./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness_negated.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd --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 f80b27594aadcdaa93090b35b429df9d0a90b0252fa7b12ed0563c83d3b4cc77 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:17:55,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:17:55,263 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-13 13:17:55,278 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:17:55,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:17:55,327 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:17:55,330 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:17:55,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:17:55,331 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:17:55,331 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:17:55,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:17:55,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:17:55,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:17:55,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:17:55,334 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:17:55,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:17:55,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:17:55,335 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:17:55,335 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:17:55,335 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:17:55,335 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:17:55,335 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:17:55,335 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:17:55,335 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:17:55,335 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:17:55,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:17:55,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:17:55,338 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:17:55,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:17:55,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:17:55,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:17:55,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:17:55,339 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:17:55,339 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:17:55,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:17:55,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:17:55,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:17:55,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:17:55,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:17:55,341 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_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd 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 -> f80b27594aadcdaa93090b35b429df9d0a90b0252fa7b12ed0563c83d3b4cc77 [2024-11-13 13:17:55,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:17:55,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:17:55,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:17:55,761 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:17:55,762 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:17:55,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness_negated.i Unable to find full path for "g++" [2024-11-13 13:17:58,180 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:17:58,923 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:17:58,924 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness_negated.i [2024-11-13 13:17:58,983 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/data/bf51810cc/236b395a269049e497dd7707e09a3b38/FLAG9b35df492 [2024-11-13 13:17:59,004 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/data/bf51810cc/236b395a269049e497dd7707e09a3b38 [2024-11-13 13:17:59,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:17:59,009 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:17:59,011 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:17:59,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:17:59,017 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:17:59,018 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:17:59" (1/1) ... [2024-11-13 13:17:59,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ca2a837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:17:59, skipping insertion in model container [2024-11-13 13:17:59,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:17:59" (1/1) ... [2024-11-13 13:17:59,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:17:59,438 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_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness_negated.i[4494,4507] [2024-11-13 13:17:59,446 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_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness_negated.i[4554,4567] [2024-11-13 13:18:00,527 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 13:18:00,528 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 13:18:00,528 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 13:18:00,529 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 13:18:00,531 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 13:18:00,551 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 13:18:00,552 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 13:18:00,554 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 13:18:00,555 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 13:18:00,558 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 13:18:00,559 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 13:18:00,560 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 13:18:00,561 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 13:18:01,339 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_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness_negated.i[150678,150691] [2024-11-13 13:18:01,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:18:01,379 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:18:01,400 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_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness_negated.i[4494,4507] [2024-11-13 13:18:01,401 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_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness_negated.i[4554,4567] [2024-11-13 13:18:01,464 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 13:18:01,465 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 13:18:01,465 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 13:18:01,495 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 13:18:01,496 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 13:18:01,517 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 13:18:01,517 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 13:18:01,519 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 13:18:01,521 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 13:18:01,522 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 13:18:01,524 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 13:18:01,525 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 13:18:01,525 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 13:18:01,694 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_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness_negated.i[150678,150691] [2024-11-13 13:18:01,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:18:01,925 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:18:01,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01 WrapperNode [2024-11-13 13:18:01,926 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:18:01,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:18:01,927 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:18:01,928 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:18:01,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01" (1/1) ... [2024-11-13 13:18:02,008 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01" (1/1) ... [2024-11-13 13:18:02,074 INFO L138 Inliner]: procedures = 668, calls = 1038, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 135 [2024-11-13 13:18:02,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:18:02,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:18:02,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:18:02,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:18:02,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01" (1/1) ... [2024-11-13 13:18:02,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01" (1/1) ... [2024-11-13 13:18:02,103 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01" (1/1) ... [2024-11-13 13:18:02,128 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 5, 14]. 67 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-13 13:18:02,128 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01" (1/1) ... [2024-11-13 13:18:02,128 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01" (1/1) ... [2024-11-13 13:18:02,157 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01" (1/1) ... [2024-11-13 13:18:02,160 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01" (1/1) ... [2024-11-13 13:18:02,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01" (1/1) ... [2024-11-13 13:18:02,170 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01" (1/1) ... [2024-11-13 13:18:02,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:18:02,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:18:02,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:18:02,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:18:02,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01" (1/1) ... [2024-11-13 13:18:02,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:18:02,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:18:02,235 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:18:02,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:18:02,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 13:18:02,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-13 13:18:02,271 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-13 13:18:02,271 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-13 13:18:02,271 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-13 13:18:02,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 13:18:02,271 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-13 13:18:02,271 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-13 13:18:02,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:18:02,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 13:18:02,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 13:18:02,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 13:18:02,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:18:02,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:18:02,272 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 13:18:02,272 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 13:18:02,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 13:18:02,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 13:18:02,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 13:18:02,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 13:18:02,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 13:18:02,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 13:18:02,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 13:18:02,273 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-13 13:18:02,273 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-13 13:18:02,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:18:02,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 13:18:02,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 13:18:02,649 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:18:02,653 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:18:03,019 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2024-11-13 13:18:03,019 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:18:03,037 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:18:03,038 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-13 13:18:03,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:18:03 BoogieIcfgContainer [2024-11-13 13:18:03,039 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:18:03,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:18:03,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:18:03,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:18:03,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:17:59" (1/3) ... [2024-11-13 13:18:03,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cde632b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:18:03, skipping insertion in model container [2024-11-13 13:18:03,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:18:01" (2/3) ... [2024-11-13 13:18:03,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cde632b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:18:03, skipping insertion in model container [2024-11-13 13:18:03,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:18:03" (3/3) ... [2024-11-13 13:18:03,050 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rend_harness_negated.i [2024-11-13 13:18:03,070 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:18:03,072 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_rend_harness_negated.i that has 6 procedures, 67 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-13 13:18:03,182 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:18:03,202 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;@69281e39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:18:03,202 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:18:03,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 48 states have internal predecessors, (64), 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-13 13:18:03,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-13 13:18:03,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:18:03,222 INFO L215 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-13 13:18:03,223 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:18:03,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:18:03,231 INFO L85 PathProgramCache]: Analyzing trace with hash 754162899, now seen corresponding path program 1 times [2024-11-13 13:18:03,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:18:03,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050666227] [2024-11-13 13:18:03,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:18:03,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:18:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:03,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:18:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:03,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:18:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:03,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:18:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:03,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:18:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:03,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 13:18:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:04,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 13:18:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:04,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 13:18:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:04,092 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 13:18:04,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:18:04,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050666227] [2024-11-13 13:18:04,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050666227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:18:04,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:18:04,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:18:04,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078176589] [2024-11-13 13:18:04,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:18:04,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 13:18:04,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:18:04,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 13:18:04,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:18:04,129 INFO L87 Difference]: Start difference. First operand has 67 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 48 states have internal predecessors, (64), 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 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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-13 13:18:04,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:18:04,161 INFO L93 Difference]: Finished difference Result 126 states and 182 transitions. [2024-11-13 13:18:04,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 13:18:04,163 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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-13 13:18:04,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:18:04,172 INFO L225 Difference]: With dead ends: 126 [2024-11-13 13:18:04,172 INFO L226 Difference]: Without dead ends: 62 [2024-11-13 13:18:04,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 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-13 13:18:04,180 INFO L432 NwaCegarLoop]: 86 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, 86 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-13 13:18:04,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:18:04,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-13 13:18:04,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-13 13:18:04,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.302325581395349) internal successors, (56), 44 states have internal predecessors, (56), 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-13 13:18:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 81 transitions. [2024-11-13 13:18:04,248 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 81 transitions. Word has length 68 [2024-11-13 13:18:04,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:18:04,249 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 81 transitions. [2024-11-13 13:18:04,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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-13 13:18:04,250 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2024-11-13 13:18:04,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-13 13:18:04,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:18:04,253 INFO L215 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-13 13:18:04,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:18:04,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:18:04,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:18:04,257 INFO L85 PathProgramCache]: Analyzing trace with hash -532145071, now seen corresponding path program 1 times [2024-11-13 13:18:04,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:18:04,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22485387] [2024-11-13 13:18:04,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:18:04,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:18:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:05,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:18:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:05,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:18:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:05,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:18:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:05,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:18:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:05,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 13:18:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:05,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 13:18:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:05,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 13:18:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:05,684 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-13 13:18:05,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:18:05,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22485387] [2024-11-13 13:18:05,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22485387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:18:05,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:18:05,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:18:05,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055490670] [2024-11-13 13:18:05,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:18:05,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:18:05,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:18:05,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:18:05,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:18:05,693 INFO L87 Difference]: Start difference. First operand 62 states and 81 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-13 13:18:05,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:18:05,819 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2024-11-13 13:18:05,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:18:05,820 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-13 13:18:05,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:18:05,827 INFO L225 Difference]: With dead ends: 72 [2024-11-13 13:18:05,829 INFO L226 Difference]: Without dead ends: 70 [2024-11-13 13:18:05,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:18:05,832 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 3 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 382 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.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:18:05,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 382 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:18:05,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-13 13:18:05,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2024-11-13 13:18:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 49 states have internal predecessors, (60), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-13 13:18:05,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2024-11-13 13:18:05,853 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 68 [2024-11-13 13:18:05,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:18:05,853 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2024-11-13 13:18:05,854 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-13 13:18:05,854 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2024-11-13 13:18:05,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-13 13:18:05,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:18:05,856 INFO L215 NwaCegarLoop]: trace histogram [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-13 13:18:05,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:18:05,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:18:05,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:18:05,861 INFO L85 PathProgramCache]: Analyzing trace with hash -758354227, now seen corresponding path program 1 times [2024-11-13 13:18:05,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:18:05,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515259801] [2024-11-13 13:18:05,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:18:05,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:18:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:06,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:18:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:06,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:18:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:06,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:18:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:07,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:18:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:07,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 13:18:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:07,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 13:18:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:07,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 13:18:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:07,461 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 13:18:07,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:18:07,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515259801] [2024-11-13 13:18:07,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515259801] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:18:07,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485554796] [2024-11-13 13:18:07,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:18:07,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:18:07,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:18:07,465 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:18:07,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:18:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:07,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 13:18:07,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:18:08,054 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-13 13:18:08,055 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:18:08,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485554796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:18:08,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:18:08,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-11-13 13:18:08,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225649770] [2024-11-13 13:18:08,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:18:08,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:18:08,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:18:08,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:18:08,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2024-11-13 13:18:08,058 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 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-13 13:18:08,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:18:08,483 INFO L93 Difference]: Finished difference Result 130 states and 173 transitions. [2024-11-13 13:18:08,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:18:08,485 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 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-13 13:18:08,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:18:08,486 INFO L225 Difference]: With dead ends: 130 [2024-11-13 13:18:08,489 INFO L226 Difference]: Without dead ends: 71 [2024-11-13 13:18:08,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-11-13 13:18:08,492 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 93 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:18:08,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 305 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:18:08,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-13 13:18:08,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-11-13 13:18:08,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 49 states have internal predecessors, (59), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-13 13:18:08,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2024-11-13 13:18:08,522 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 70 [2024-11-13 13:18:08,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:18:08,523 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2024-11-13 13:18:08,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 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-13 13:18:08,523 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2024-11-13 13:18:08,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-13 13:18:08,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:18:08,529 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-13 13:18:08,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-13 13:18:08,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:18:08,730 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:18:08,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:18:08,730 INFO L85 PathProgramCache]: Analyzing trace with hash 910920282, now seen corresponding path program 1 times [2024-11-13 13:18:08,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:18:08,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122588781] [2024-11-13 13:18:08,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:18:08,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:18:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:09,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:18:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:09,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:18:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:09,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:18:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:09,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:18:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:09,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 13:18:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:09,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 13:18:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:09,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 13:18:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:09,733 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-13 13:18:09,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:18:09,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122588781] [2024-11-13 13:18:09,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122588781] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:18:09,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982722701] [2024-11-13 13:18:09,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:18:09,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:18:09,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:18:09,736 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:18:09,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:18:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:10,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 13:18:10,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:18:10,274 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-13 13:18:10,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:18:10,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982722701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:18:10,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:18:10,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2024-11-13 13:18:10,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338967583] [2024-11-13 13:18:10,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:18:10,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:18:10,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:18:10,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:18:10,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-11-13 13:18:10,277 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 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-13 13:18:10,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:18:10,703 INFO L93 Difference]: Finished difference Result 136 states and 181 transitions. [2024-11-13 13:18:10,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:18:10,704 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 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-13 13:18:10,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:18:10,705 INFO L225 Difference]: With dead ends: 136 [2024-11-13 13:18:10,706 INFO L226 Difference]: Without dead ends: 76 [2024-11-13 13:18:10,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2024-11-13 13:18:10,707 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 107 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:18:10,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 341 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:18:10,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-13 13:18:10,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2024-11-13 13:18:10,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-13 13:18:10,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2024-11-13 13:18:10,721 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 72 [2024-11-13 13:18:10,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:18:10,722 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2024-11-13 13:18:10,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 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-13 13:18:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2024-11-13 13:18:10,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 13:18:10,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:18:10,725 INFO L215 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-13 13:18:10,751 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 13:18:10,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:18:10,926 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:18:10,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:18:10,926 INFO L85 PathProgramCache]: Analyzing trace with hash 752385076, now seen corresponding path program 1 times [2024-11-13 13:18:10,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:18:10,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779795378] [2024-11-13 13:18:10,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:18:10,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:18:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:11,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:18:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:11,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:18:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:11,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:18:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:11,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:18:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:11,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 13:18:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:11,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 13:18:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:11,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 13:18:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:11,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-13 13:18:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:11,502 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 13:18:11,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:18:11,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779795378] [2024-11-13 13:18:11,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779795378] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:18:11,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816330021] [2024-11-13 13:18:11,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:18:11,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:18:11,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:18:11,505 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:18:11,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 13:18:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:11,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-13 13:18:11,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:18:11,957 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-13 13:18:11,979 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 7 [2024-11-13 13:18:12,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:18:12,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:18:12,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:18:12,148 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 45 treesize of output 21 [2024-11-13 13:18:12,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:18:12,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:18:12,171 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 26 treesize of output 29 [2024-11-13 13:18:13,198 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-13 13:18:13,198 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:18:13,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816330021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:18:13,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:18:13,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2024-11-13 13:18:13,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479742149] [2024-11-13 13:18:13,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:18:13,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:18:13,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:18:13,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:18:13,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-13 13:18:13,200 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-13 13:18:14,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:18:14,023 INFO L93 Difference]: Finished difference Result 191 states and 253 transitions. [2024-11-13 13:18:14,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:18:14,024 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 74 [2024-11-13 13:18:14,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:18:14,026 INFO L225 Difference]: With dead ends: 191 [2024-11-13 13:18:14,027 INFO L226 Difference]: Without dead ends: 134 [2024-11-13 13:18:14,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-13 13:18:14,028 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 67 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:18:14,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 359 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 13:18:14,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-13 13:18:14,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2024-11-13 13:18:14,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 96 states have internal predecessors, (116), 26 states have call successors, (26), 11 states have call predecessors, (26), 14 states have return successors, (34), 24 states have call predecessors, (34), 24 states have call successors, (34) [2024-11-13 13:18:14,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 176 transitions. [2024-11-13 13:18:14,061 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 176 transitions. Word has length 74 [2024-11-13 13:18:14,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:18:14,061 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 176 transitions. [2024-11-13 13:18:14,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-13 13:18:14,062 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 176 transitions. [2024-11-13 13:18:14,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 13:18:14,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:18:14,064 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:18:14,090 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 13:18:14,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:18:14,268 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:18:14,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:18:14,268 INFO L85 PathProgramCache]: Analyzing trace with hash 271304818, now seen corresponding path program 1 times [2024-11-13 13:18:14,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:18:14,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703552022] [2024-11-13 13:18:14,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:18:14,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:18:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:14,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:18:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:14,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:18:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:14,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:18:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:14,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:18:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:14,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 13:18:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:14,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 13:18:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:14,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 13:18:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:14,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-13 13:18:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:14,791 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 13:18:14,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:18:14,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703552022] [2024-11-13 13:18:14,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703552022] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:18:14,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412131373] [2024-11-13 13:18:14,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:18:14,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:18:14,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:18:14,795 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:18:14,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 13:18:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:15,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-13 13:18:15,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:18:15,143 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-13 13:18:15,162 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-13 13:18:15,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:18:15,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:18:15,270 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-13 13:18:15,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:18:15,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:18:15,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:18:15,304 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-13 13:18:17,735 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-13 13:18:17,736 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:18:17,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412131373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:18:17,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:18:17,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2024-11-13 13:18:17,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926480572] [2024-11-13 13:18:17,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:18:17,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 13:18:17,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:18:17,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 13:18:17,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-13 13:18:17,738 INFO L87 Difference]: Start difference. First operand 132 states and 176 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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-13 13:18:18,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:18:18,735 INFO L93 Difference]: Finished difference Result 191 states and 249 transitions. [2024-11-13 13:18:18,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:18:18,737 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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-13 13:18:18,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:18:18,739 INFO L225 Difference]: With dead ends: 191 [2024-11-13 13:18:18,739 INFO L226 Difference]: Without dead ends: 132 [2024-11-13 13:18:18,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 74 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-13 13:18:18,745 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 56 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:18:18,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 385 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 13:18:18,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-13 13:18:18,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2024-11-13 13:18:18,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 94 states have internal predecessors, (114), 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-13 13:18:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 172 transitions. [2024-11-13 13:18:18,794 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 172 transitions. Word has length 74 [2024-11-13 13:18:18,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:18:18,794 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 172 transitions. [2024-11-13 13:18:18,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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-13 13:18:18,794 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 172 transitions. [2024-11-13 13:18:18,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 13:18:18,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:18:18,797 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:18:18,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-13 13:18:18,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:18:18,998 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:18:18,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:18:18,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1611592793, now seen corresponding path program 1 times [2024-11-13 13:18:18,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:18:18,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830003787] [2024-11-13 13:18:18,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:18:18,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:18:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:19,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:18:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:19,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:18:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:19,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:18:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:19,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:18:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:19,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 13:18:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:19,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 13:18:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:19,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 13:18:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:19,403 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-13 13:18:19,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:18:19,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830003787] [2024-11-13 13:18:19,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830003787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:18:19,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:18:19,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:18:19,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865677875] [2024-11-13 13:18:19,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:18:19,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:18:19,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:18:19,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:18:19,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:18:19,405 INFO L87 Difference]: Start difference. First operand 130 states and 172 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-13 13:18:19,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:18:19,490 INFO L93 Difference]: Finished difference Result 251 states and 342 transitions. [2024-11-13 13:18:19,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:18:19,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-13 13:18:19,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:18:19,493 INFO L225 Difference]: With dead ends: 251 [2024-11-13 13:18:19,493 INFO L226 Difference]: Without dead ends: 138 [2024-11-13 13:18:19,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:18:19,495 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 10 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:18:19,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 266 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:18:19,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-13 13:18:19,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 132. [2024-11-13 13:18:19,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 96 states have internal predecessors, (116), 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-13 13:18:19,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 174 transitions. [2024-11-13 13:18:19,537 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 174 transitions. Word has length 73 [2024-11-13 13:18:19,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:18:19,538 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 174 transitions. [2024-11-13 13:18:19,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-13 13:18:19,538 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 174 transitions. [2024-11-13 13:18:19,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 13:18:19,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:18:19,543 INFO L215 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-13 13:18:19,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 13:18:19,543 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:18:19,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:18:19,543 INFO L85 PathProgramCache]: Analyzing trace with hash -465052818, now seen corresponding path program 1 times [2024-11-13 13:18:19,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:18:19,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298013654] [2024-11-13 13:18:19,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:18:19,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:18:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:19,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:18:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:19,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:18:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:19,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:18:19,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:19,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:18:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:19,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 13:18:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:19,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 13:18:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:20,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 13:18:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:20,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-13 13:18:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:20,077 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-13 13:18:20,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:18:20,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298013654] [2024-11-13 13:18:20,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298013654] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:18:20,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322628315] [2024-11-13 13:18:20,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:18:20,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:18:20,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:18:20,081 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:18:20,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 13:18:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:18:20,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 13:18:20,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:18:20,600 INFO L349 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2024-11-13 13:18:20,600 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 60 treesize of output 104 [2024-11-13 13:18:20,611 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 11 [2024-11-13 13:18:20,650 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:18:20,651 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-13 13:18:20,709 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:18:20,710 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 33 treesize of output 9 [2024-11-13 13:18:20,715 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 9 treesize of output 7 [2024-11-13 13:18:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:18:53,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:18:53,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322628315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:18:53,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:18:53,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [6] total 24 [2024-11-13 13:18:53,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043023755] [2024-11-13 13:18:53,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:18:53,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 13:18:53,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:18:53,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 13:18:53,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=404, Unknown=52, NotChecked=0, Total=552 [2024-11-13 13:18:53,561 INFO L87 Difference]: Start difference. First operand 132 states and 174 transitions. Second operand has 20 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 16 states have internal predecessors, (56), 7 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-13 13:19:08,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:19:30,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:20:08,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:20:11,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:20:13,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:20:18,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:20:22,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:22,322 INFO L93 Difference]: Finished difference Result 251 states and 326 transitions. [2024-11-13 13:20:22,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 13:20:22,323 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 16 states have internal predecessors, (56), 7 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 74 [2024-11-13 13:20:22,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:22,327 INFO L225 Difference]: With dead ends: 251 [2024-11-13 13:20:22,327 INFO L226 Difference]: Without dead ends: 201 [2024-11-13 13:20:22,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 76.7s TimeCoverageRelationStatistics Valid=293, Invalid=1304, Unknown=125, NotChecked=0, Total=1722 [2024-11-13 13:20:22,333 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 182 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 13 mSolverCounterUnsat, 334 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 334 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:22,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 773 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 403 Invalid, 334 Unknown, 0 Unchecked, 41.0s Time] [2024-11-13 13:20:22,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-13 13:20:22,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 181. [2024-11-13 13:20:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 132 states have (on average 1.303030303030303) internal successors, (172), 136 states have internal predecessors, (172), 30 states have call successors, (30), 16 states have call predecessors, (30), 18 states have return successors, (38), 28 states have call predecessors, (38), 28 states have call successors, (38) [2024-11-13 13:20:22,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 240 transitions. [2024-11-13 13:20:22,390 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 240 transitions. Word has length 74 [2024-11-13 13:20:22,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:22,390 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 240 transitions. [2024-11-13 13:20:22,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 16 states have internal predecessors, (56), 7 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-13 13:20:22,391 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 240 transitions. [2024-11-13 13:20:22,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 13:20:22,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:22,393 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:22,419 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 13:20:22,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-13 13:20:22,597 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:20:22,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:22,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1486121172, now seen corresponding path program 1 times [2024-11-13 13:20:22,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:22,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927710664] [2024-11-13 13:20:22,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:22,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:22,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:20:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:22,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:20:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:22,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:20:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:22,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:20:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:22,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 13:20:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:22,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 13:20:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:23,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 13:20:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:23,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-13 13:20:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:23,054 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-13 13:20:23,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:23,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927710664] [2024-11-13 13:20:23,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927710664] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:20:23,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318183279] [2024-11-13 13:20:23,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:23,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:23,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:23,058 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:23,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 13:20:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:23,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-13 13:20:23,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:23,547 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2024-11-13 13:20:23,548 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-13 13:20:23,564 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-13 13:20:23,582 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:20:23,583 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-13 13:20:23,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:20:23,633 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 69 treesize of output 26 [2024-11-13 13:20:24,263 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-13 13:20:24,263 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:24,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318183279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:24,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:20:24,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2024-11-13 13:20:24,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775854097] [2024-11-13 13:20:24,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:24,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 13:20:24,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:24,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 13:20:24,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-13 13:20:24,266 INFO L87 Difference]: Start difference. First operand 181 states and 240 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-13 13:20:28,275 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-13 13:20:32,342 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-13 13:20:36,410 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-13 13:20:40,475 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-13 13:20:44,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:20:45,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:20:45,348 INFO L93 Difference]: Finished difference Result 307 states and 412 transitions. [2024-11-13 13:20:45,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 13:20:45,349 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 74 [2024-11-13 13:20:45,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:20:45,352 INFO L225 Difference]: With dead ends: 307 [2024-11-13 13:20:45,353 INFO L226 Difference]: Without dead ends: 207 [2024-11-13 13:20:45,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-13 13:20:45,355 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 210 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 77 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:20:45,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 348 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 222 Invalid, 5 Unknown, 0 Unchecked, 20.7s Time] [2024-11-13 13:20:45,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-13 13:20:45,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2024-11-13 13:20:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 151 states have (on average 1.3112582781456954) internal successors, (198), 157 states have internal predecessors, (198), 31 states have call successors, (31), 16 states have call predecessors, (31), 20 states have return successors, (45), 29 states have call predecessors, (45), 29 states have call successors, (45) [2024-11-13 13:20:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 274 transitions. [2024-11-13 13:20:45,416 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 274 transitions. Word has length 74 [2024-11-13 13:20:45,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:20:45,417 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 274 transitions. [2024-11-13 13:20:45,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-13 13:20:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 274 transitions. [2024-11-13 13:20:45,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 13:20:45,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:20:45,419 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:20:45,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 13:20:45,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-13 13:20:45,620 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:20:45,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:20:45,620 INFO L85 PathProgramCache]: Analyzing trace with hash 52218858, now seen corresponding path program 2 times [2024-11-13 13:20:45,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:20:45,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521765703] [2024-11-13 13:20:45,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:20:45,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:20:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:45,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:20:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:45,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:20:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:45,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:20:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:45,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:20:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:45,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 13:20:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:45,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 13:20:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:45,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 13:20:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:45,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-13 13:20:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:20:46,005 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-13 13:20:46,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:20:46,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521765703] [2024-11-13 13:20:46,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521765703] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:20:46,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101819380] [2024-11-13 13:20:46,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:20:46,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:20:46,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:20:46,009 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:20:46,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 13:20:46,319 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:20:46,319 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:20:46,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-13 13:20:46,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:20:46,558 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2024-11-13 13:20:46,558 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-13 13:20:46,573 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-13 13:20:46,600 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-13 13:20:46,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:20:46,637 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 69 treesize of output 26 [2024-11-13 13:20:47,740 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-13 13:20:47,741 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:20:47,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101819380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:20:47,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:20:47,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2024-11-13 13:20:47,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230628522] [2024-11-13 13:20:47,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:20:47,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 13:20:47,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:20:47,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 13:20:47,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-13 13:20:47,746 INFO L87 Difference]: Start difference. First operand 203 states and 274 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-13 13:20:51,760 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-13 13:20:55,836 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-13 13:20:59,924 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-13 13:21:04,003 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-13 13:21:08,015 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-13 13:21:09,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:21:09,009 INFO L93 Difference]: Finished difference Result 300 states and 398 transitions. [2024-11-13 13:21:09,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 13:21:09,011 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-13 13:21:09,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:21:09,013 INFO L225 Difference]: With dead ends: 300 [2024-11-13 13:21:09,013 INFO L226 Difference]: Without dead ends: 189 [2024-11-13 13:21:09,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2024-11-13 13:21:09,016 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 202 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 58 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:21:09,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 435 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 259 Invalid, 5 Unknown, 0 Unchecked, 20.8s Time] [2024-11-13 13:21:09,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-13 13:21:09,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 181. [2024-11-13 13:21:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 132 states have (on average 1.2954545454545454) internal successors, (171), 136 states have internal predecessors, (171), 30 states have call successors, (30), 16 states have call predecessors, (30), 18 states have return successors, (38), 28 states have call predecessors, (38), 28 states have call successors, (38) [2024-11-13 13:21:09,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 239 transitions. [2024-11-13 13:21:09,072 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 239 transitions. Word has length 74 [2024-11-13 13:21:09,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:21:09,072 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 239 transitions. [2024-11-13 13:21:09,072 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-13 13:21:09,073 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 239 transitions. [2024-11-13 13:21:09,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 13:21:09,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:21:09,077 INFO L215 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-13 13:21:09,104 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 13:21:09,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:09,277 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:21:09,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:21:09,278 INFO L85 PathProgramCache]: Analyzing trace with hash 2103202856, now seen corresponding path program 1 times [2024-11-13 13:21:09,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:21:09,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269891682] [2024-11-13 13:21:09,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:09,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:21:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:09,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:21:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:09,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:21:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:09,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:21:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:09,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:21:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:09,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 13:21:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:09,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 13:21:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:09,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 13:21:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:09,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-13 13:21:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:09,678 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-13 13:21:09,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:21:09,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269891682] [2024-11-13 13:21:09,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269891682] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:21:09,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075321333] [2024-11-13 13:21:09,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:09,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:09,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:21:09,681 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:21:09,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 13:21:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:09,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-13 13:21:09,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:21:10,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-13 13:21:10,079 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-13 13:21:10,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:21:10,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:21:10,182 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-13 13:21:10,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:21:10,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:21:10,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:21:10,231 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-13 13:21:12,964 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-13 13:21:12,965 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:21:12,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075321333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:21:12,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:21:12,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2024-11-13 13:21:12,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347425703] [2024-11-13 13:21:12,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:21:12,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 13:21:12,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:21:12,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 13:21:12,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-13 13:21:12,966 INFO L87 Difference]: Start difference. First operand 181 states and 239 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-13 13:21:14,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:21:14,558 INFO L93 Difference]: Finished difference Result 320 states and 429 transitions. [2024-11-13 13:21:14,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 13:21:14,559 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-13 13:21:14,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:21:14,562 INFO L225 Difference]: With dead ends: 320 [2024-11-13 13:21:14,562 INFO L226 Difference]: Without dead ends: 191 [2024-11-13 13:21:14,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 73 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-11-13 13:21:14,564 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 77 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:21:14,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 475 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 13:21:14,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-13 13:21:14,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 183. [2024-11-13 13:21:14,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 134 states have (on average 1.291044776119403) internal successors, (173), 138 states have internal predecessors, (173), 30 states have call successors, (30), 16 states have call predecessors, (30), 18 states have return successors, (38), 28 states have call predecessors, (38), 28 states have call successors, (38) [2024-11-13 13:21:14,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 241 transitions. [2024-11-13 13:21:14,614 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 241 transitions. Word has length 74 [2024-11-13 13:21:14,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:21:14,614 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 241 transitions. [2024-11-13 13:21:14,614 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-13 13:21:14,615 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 241 transitions. [2024-11-13 13:21:14,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 13:21:14,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:21:14,616 INFO L215 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-13 13:21:14,642 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 13:21:14,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:14,821 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:21:14,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:21:14,822 INFO L85 PathProgramCache]: Analyzing trace with hash 590710370, now seen corresponding path program 1 times [2024-11-13 13:21:14,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:21:14,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773169755] [2024-11-13 13:21:14,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:14,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:21:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:15,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:21:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:15,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:21:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:15,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:21:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:15,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:21:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:15,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 13:21:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:15,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 13:21:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:15,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 13:21:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:15,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-13 13:21:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:15,860 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-13 13:21:15,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:21:15,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773169755] [2024-11-13 13:21:15,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773169755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:21:15,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332171254] [2024-11-13 13:21:15,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:15,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:15,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:21:15,865 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:21:15,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 13:21:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:16,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 13:21:16,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:21:16,427 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-13 13:21:18,301 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-13 13:21:18,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:21:18,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332171254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:21:18,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:21:18,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2024-11-13 13:21:18,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023891177] [2024-11-13 13:21:18,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:21:18,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 13:21:18,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:21:18,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 13:21:18,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-11-13 13:21:18,303 INFO L87 Difference]: Start difference. First operand 183 states and 241 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 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-13 13:21:22,314 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-13 13:21:26,404 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-13 13:21:30,475 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-13 13:21:34,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:21:38,572 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-13 13:21:39,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:21:39,513 INFO L93 Difference]: Finished difference Result 334 states and 447 transitions. [2024-11-13 13:21:39,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 13:21:39,514 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 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-13 13:21:39,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:21:39,516 INFO L225 Difference]: With dead ends: 334 [2024-11-13 13:21:39,517 INFO L226 Difference]: Without dead ends: 193 [2024-11-13 13:21:39,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 73 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2024-11-13 13:21:39,519 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 222 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 58 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:21:39,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 414 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 263 Invalid, 5 Unknown, 0 Unchecked, 20.8s Time] [2024-11-13 13:21:39,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-13 13:21:39,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 185. [2024-11-13 13:21:39,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 136 states have (on average 1.286764705882353) internal successors, (175), 140 states have internal predecessors, (175), 30 states have call successors, (30), 16 states have call predecessors, (30), 18 states have return successors, (38), 28 states have call predecessors, (38), 28 states have call successors, (38) [2024-11-13 13:21:39,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 243 transitions. [2024-11-13 13:21:39,561 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 243 transitions. Word has length 74 [2024-11-13 13:21:39,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:21:39,562 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 243 transitions. [2024-11-13 13:21:39,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 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-13 13:21:39,562 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 243 transitions. [2024-11-13 13:21:39,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 13:21:39,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:21:39,564 INFO L215 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-13 13:21:39,587 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 13:21:39,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:39,768 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:21:39,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:21:39,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1215622628, now seen corresponding path program 1 times [2024-11-13 13:21:39,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:21:39,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638581438] [2024-11-13 13:21:39,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:39,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:21:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:39,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:21:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:39,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:21:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:39,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:21:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:39,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:21:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:39,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 13:21:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:39,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 13:21:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:40,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 13:21:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:40,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-13 13:21:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:40,024 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-13 13:21:40,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:21:40,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638581438] [2024-11-13 13:21:40,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638581438] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:21:40,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403662257] [2024-11-13 13:21:40,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:40,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:40,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:21:40,027 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:21:40,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 13:21:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:40,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 13:21:40,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:21:40,450 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-13 13:21:40,451 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:21:40,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403662257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:21:40,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:21:40,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2024-11-13 13:21:40,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871392868] [2024-11-13 13:21:40,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:21:40,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:21:40,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:21:40,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:21:40,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:21:40,454 INFO L87 Difference]: Start difference. First operand 185 states and 243 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-13 13:21:40,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:21:40,690 INFO L93 Difference]: Finished difference Result 342 states and 456 transitions. [2024-11-13 13:21:40,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:21:40,691 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-13 13:21:40,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:21:40,693 INFO L225 Difference]: With dead ends: 342 [2024-11-13 13:21:40,694 INFO L226 Difference]: Without dead ends: 176 [2024-11-13 13:21:40,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 86 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-13 13:21:40,698 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 111 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:21:40,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 196 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:21:40,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-13 13:21:40,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2024-11-13 13:21:40,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 131 states have (on average 1.2595419847328244) internal successors, (165), 137 states have internal predecessors, (165), 28 states have call successors, (28), 12 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-13 13:21:40,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 231 transitions. [2024-11-13 13:21:40,748 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 231 transitions. Word has length 74 [2024-11-13 13:21:40,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:21:40,748 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 231 transitions. [2024-11-13 13:21:40,748 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-13 13:21:40,749 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 231 transitions. [2024-11-13 13:21:40,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 13:21:40,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:21:40,751 INFO L215 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] [2024-11-13 13:21:40,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-13 13:21:40,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:40,951 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:21:40,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:21:40,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1429718044, now seen corresponding path program 1 times [2024-11-13 13:21:40,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:21:40,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109165687] [2024-11-13 13:21:40,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:40,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:21:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:41,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:21:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:41,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:21:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:41,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:21:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:41,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:21:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:41,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 13:21:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:41,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:21:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:41,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 13:21:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:41,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 13:21:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:41,581 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-13 13:21:41,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:21:41,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109165687] [2024-11-13 13:21:41,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109165687] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:21:41,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111529942] [2024-11-13 13:21:41,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:41,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:41,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:21:41,585 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:21:41,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 13:21:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:41,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-13 13:21:41,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:21:41,995 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-13 13:21:42,019 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-13 13:21:42,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:21:42,113 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-13 13:21:42,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:21:42,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 13:21:42,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:21:42,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:21:42,139 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-13 13:21:42,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:21:42,150 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-13 13:21:42,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:21:42,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:21:42,285 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 38 treesize of output 35 [2024-11-13 13:21:42,293 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 24 treesize of output 13 [2024-11-13 13:21:42,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:21:42,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:21:42,308 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 47 treesize of output 42 [2024-11-13 13:21:42,315 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-13 13:21:43,524 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 13:21:43,524 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:21:44,073 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_rend_harness_~#list~0#1.offset|))) (and (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_882 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_882))) (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 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_885 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_885))) (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 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2024-11-13 13:21:44,152 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_rend_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_17| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_17| 1)) (forall ((v_ArrVal_881 Int) (v_ArrVal_885 (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_881)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_17| v_ArrVal_885))) (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_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_17|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_17| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_17| 1)) (forall ((v_ArrVal_879 Int) (v_subst_1 Int) (v_ArrVal_882 (Array Int 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_879)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_17| v_ArrVal_882))) (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_rend_harness_~#list~0#1.base|) .cse2) 0)))))) is different from false [2024-11-13 13:21:44,178 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:21:44,180 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:21:44,350 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2024-11-13 13:21:44,351 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-13 13:21:44,373 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:21:44,375 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:21:44,551 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2024-11-13 13:21:44,552 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 327 treesize of output 314 [2024-11-13 13:21:44,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:21:44,679 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 260 treesize of output 258 [2024-11-13 13:21:44,762 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 217 treesize of output 205 [2024-11-13 13:21:44,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:21:44,831 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 296 [2024-11-13 13:21:44,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 263 treesize of output 251 [2024-11-13 13:21:44,912 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-13 13:21:45,929 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-13 13:21:45,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:21:45,964 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 86 treesize of output 88 [2024-11-13 13:21:46,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:21:46,042 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 38 treesize of output 38 [2024-11-13 13:21:46,131 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 1 not checked. [2024-11-13 13:21:46,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111529942] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:21:46,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:21:46,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 23 [2024-11-13 13:21:46,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869489323] [2024-11-13 13:21:46,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:21:46,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 13:21:46,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:21:46,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 13:21:46,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=364, Unknown=2, NotChecked=78, Total=506 [2024-11-13 13:21:46,134 INFO L87 Difference]: Start difference. First operand 176 states and 231 transitions. Second operand has 23 states, 20 states have (on average 5.05) internal successors, (101), 22 states have internal predecessors, (101), 9 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 7 states have call predecessors, (21), 9 states have call successors, (21) [2024-11-13 13:21:48,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:21:48,195 INFO L93 Difference]: Finished difference Result 267 states and 354 transitions. [2024-11-13 13:21:48,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-13 13:21:48,195 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 5.05) internal successors, (101), 22 states have internal predecessors, (101), 9 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 7 states have call predecessors, (21), 9 states have call successors, (21) Word has length 75 [2024-11-13 13:21:48,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:21:48,197 INFO L225 Difference]: With dead ends: 267 [2024-11-13 13:21:48,197 INFO L226 Difference]: Without dead ends: 184 [2024-11-13 13:21:48,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 145 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=131, Invalid=867, Unknown=2, NotChecked=122, Total=1122 [2024-11-13 13:21:48,199 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 68 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 268 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:21:48,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1163 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 702 Invalid, 0 Unknown, 268 Unchecked, 1.4s Time] [2024-11-13 13:21:48,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-13 13:21:48,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2024-11-13 13:21:48,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 136 states have (on average 1.25) internal successors, (170), 142 states have internal predecessors, (170), 28 states have call successors, (28), 13 states have call predecessors, (28), 17 states have return successors, (37), 26 states have call predecessors, (37), 26 states have call successors, (37) [2024-11-13 13:21:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 235 transitions. [2024-11-13 13:21:48,245 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 235 transitions. Word has length 75 [2024-11-13 13:21:48,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:21:48,246 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 235 transitions. [2024-11-13 13:21:48,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 5.05) internal successors, (101), 22 states have internal predecessors, (101), 9 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 7 states have call predecessors, (21), 9 states have call successors, (21) [2024-11-13 13:21:48,246 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 235 transitions. [2024-11-13 13:21:48,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-13 13:21:48,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:21:48,248 INFO L215 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-13 13:21:48,278 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 13:21:48,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:48,453 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:21:48,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:21:48,454 INFO L85 PathProgramCache]: Analyzing trace with hash -965835928, now seen corresponding path program 1 times [2024-11-13 13:21:48,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:21:48,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187940977] [2024-11-13 13:21:48,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:48,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:21:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:48,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:21:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:48,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:21:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:48,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:21:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:49,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:21:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:49,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 13:21:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:49,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:21:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:49,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 13:21:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:49,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 13:21:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:49,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:21:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 13:21:49,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:21:49,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187940977] [2024-11-13 13:21:49,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187940977] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:21:49,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414488944] [2024-11-13 13:21:49,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:49,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:49,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:21:49,151 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:21:49,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 13:21:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:49,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 13:21:49,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:21:49,717 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-13 13:21:49,717 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:21:49,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414488944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:21:49,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:21:49,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2024-11-13 13:21:49,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805145013] [2024-11-13 13:21:49,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:21:49,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:21:49,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:21:49,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:21:49,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-13 13:21:49,720 INFO L87 Difference]: Start difference. First operand 182 states and 235 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-13 13:21:49,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:21:49,927 INFO L93 Difference]: Finished difference Result 330 states and 423 transitions. [2024-11-13 13:21:49,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:21:49,927 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-13 13:21:49,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:21:49,929 INFO L225 Difference]: With dead ends: 330 [2024-11-13 13:21:49,930 INFO L226 Difference]: Without dead ends: 131 [2024-11-13 13:21:49,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-13 13:21:49,932 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 102 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:21:49,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 300 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:21:49,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-13 13:21:49,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2024-11-13 13:21:49,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 91 states have (on average 1.1978021978021978) internal successors, (109), 94 states have internal predecessors, (109), 25 states have call successors, (25), 11 states have call predecessors, (25), 12 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2024-11-13 13:21:49,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 160 transitions. [2024-11-13 13:21:49,961 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 160 transitions. Word has length 87 [2024-11-13 13:21:49,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:21:49,962 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 160 transitions. [2024-11-13 13:21:49,962 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-13 13:21:49,962 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 160 transitions. [2024-11-13 13:21:49,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-13 13:21:49,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:21:49,964 INFO L215 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] [2024-11-13 13:21:49,981 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 13:21:50,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-13 13:21:50,165 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:21:50,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:21:50,165 INFO L85 PathProgramCache]: Analyzing trace with hash 635003588, now seen corresponding path program 1 times [2024-11-13 13:21:50,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:21:50,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317103099] [2024-11-13 13:21:50,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:50,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:21:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:50,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:21:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:50,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:21:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:50,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:21:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:50,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:21:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:50,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 13:21:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:50,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-13 13:21:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:50,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:21:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:50,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 13:21:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:50,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 13:21:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:50,763 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 13:21:50,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:21:50,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317103099] [2024-11-13 13:21:50,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317103099] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:21:50,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422752789] [2024-11-13 13:21:50,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:50,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:50,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:21:50,766 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:21:50,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 13:21:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:51,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-13 13:21:51,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:21:51,256 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2024-11-13 13:21:51,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 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-13 13:21:51,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2024-11-13 13:21:51,284 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:21:51,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 1 [2024-11-13 13:21:51,335 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:21:51,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 41 treesize of output 13 [2024-11-13 13:21:51,341 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-13 13:21:51,356 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2))) (and (not (= .cse0 0)) (or (= .cse0 |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_7) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base| (store .cse1 .cse2 .cse0)) .cse0) .cse1))))))) is different from true [2024-11-13 13:21:51,396 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| 24)))) (and (= .cse0 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| 24))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) .cse3))) (and (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse2))) (= .cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| (store .cse1 .cse3 .cse2)) .cse2)))) (not (= .cse2 0))))))) is different from true [2024-11-13 13:21:52,051 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| 24)))) (and (= .cse0 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| 24))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) .cse3))) (and (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse2))) (= .cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| (store .cse1 .cse3 .cse2)) .cse2)))) (not (= .cse2 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| 24))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53|) .cse6))) (and (not (= .cse4 0)) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse4))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| (store .cse5 .cse6 .cse4)) .cse4) .cse5))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| 24)))) (and (not (= .cse7 0)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| .cse7)))))) is different from true [2024-11-13 13:21:52,258 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse6))) (and (not (= .cse0 0)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| 24)))) (and (= .cse1 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) (not (= .cse1 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) .cse4))) (and (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse3))) (= .cse2 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| (store .cse2 .cse4 .cse3)) .cse3)))) (not (= .cse3 0))))))) (or (= .cse0 |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_7) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base| (store .cse5 .cse6 .cse0)) .cse0) .cse5)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| Int)) (let ((.cse9 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53|) .cse9))) (and (not (= .cse7 0)) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse7))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| (store .cse8 .cse9 .cse7)) .cse7) .cse8))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| 24)))) (and (not (= .cse10 0)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| .cse10)))))))) is different from true [2024-11-13 13:21:52,341 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 24 |c_ULTIMATE.start_aws_linked_list_rend_~list#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rend_~list#1.base|) .cse6))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| 24)))) (and (= .cse0 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| 24))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) .cse3))) (and (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse2))) (= .cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| (store .cse1 .cse3 .cse2)) .cse2)))) (not (= .cse2 0))))))) (not (= 0 .cse4)) (or (= |c_ULTIMATE.start_aws_linked_list_rend_~list#1.base| .cse4) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse4))) (= .cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_7) |c_ULTIMATE.start_aws_linked_list_rend_~list#1.base| (store .cse5 .cse6 .cse4)) .cse4))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| Int)) (let ((.cse9 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53|) .cse9))) (and (not (= .cse7 0)) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse7))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| (store .cse8 .cse9 .cse7)) .cse7) .cse8))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| 24)))) (and (not (= .cse10 0)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| .cse10)))))))) is different from true [2024-11-13 13:21:52,414 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| 24)))) (and (= .cse0 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| 24))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) .cse3))) (and (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse2))) (= .cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| (store .cse1 .cse3 .cse2)) .cse2)))) (not (= .cse2 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| 24))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53|) .cse6))) (and (not (= .cse4 0)) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse4))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| (store .cse5 .cse6 .cse4)) .cse4) .cse5))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| 24)))) (and (not (= .cse7 0)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| .cse7))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| 24)))) (and (= .cse8 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24|) (not (= .cse8 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24|) .cse11))) (and (not (= .cse9 0)) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse9))) (= .cse10 (select (store (store |c_#memory_$Pointer$#2.base| .cse9 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24| (store .cse10 .cse11 .cse9)) .cse9)))))))))) is different from true [2024-11-13 13:21:53,099 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 24 |c_ULTIMATE.start_aws_linked_list_rend_~list#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rend_~list#1.base|) .cse6))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| 24)))) (and (= .cse0 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) (not (= .cse0 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| 24))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) .cse3))) (and (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse2))) (= .cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| (store .cse1 .cse3 .cse2)) .cse2)))) (not (= .cse2 0))))))) (not (= 0 .cse4)) (or (= |c_ULTIMATE.start_aws_linked_list_rend_~list#1.base| .cse4) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse4))) (= .cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_7) |c_ULTIMATE.start_aws_linked_list_rend_~list#1.base| (store .cse5 .cse6 .cse4)) .cse4))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| Int)) (let ((.cse9 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53|) .cse9))) (and (not (= .cse7 0)) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse7))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| (store .cse8 .cse9 .cse7)) .cse7) .cse8))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| 24)))) (and (not (= .cse10 0)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| .cse10))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| 24)))) (and (= .cse11 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24|) (not (= .cse11 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24| Int)) (let ((.cse14 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24|) .cse14))) (and (not (= .cse12 0)) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse12))) (= .cse13 (select (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24| (store .cse13 .cse14 .cse12)) .cse12)))))))))))) is different from true [2024-11-13 13:21:53,181 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_18| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25|) .cse2))) (and (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25| (store .cse1 .cse2 .cse0)) .cse0) .cse1))) (not (= .cse0 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_18| 24)))) (and (= .cse3 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25|) (not (= .cse3 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| 24)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) (not (= .cse4 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) .cse7))) (and (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse6))) (= .cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| (store .cse5 .cse7 .cse6)) .cse6)))) (not (= .cse6 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| 24))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53|) .cse10))) (and (not (= .cse8 0)) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse8))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| (store .cse9 .cse10 .cse8)) .cse8) .cse9))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| 24)))) (and (not (= .cse11 0)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| .cse11))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| 24)))) (and (= .cse12 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24|) (not (= .cse12 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24| Int)) (let ((.cse15 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24|) .cse15))) (and (not (= .cse13 0)) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| .cse13))) (= .cse14 (select (store (store |c_#memory_$Pointer$#2.base| .cse13 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24| (store .cse14 .cse15 .cse13)) .cse13)))))))))) is different from true [2024-11-13 13:21:53,523 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (+ 24 |c_ULTIMATE.start_aws_linked_list_rend_~list#1.offset|))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rend_~list#1.base|) .cse10))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_18| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25|) .cse2))) (and (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25| (store .cse1 .cse2 .cse0)) .cse0) .cse1))) (not (= .cse0 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_18| 24)))) (and (= .cse3 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25|) (not (= .cse3 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| 24)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) (not (= .cse4 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) .cse7))) (and (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse6))) (= .cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| (store .cse5 .cse7 .cse6)) .cse6)))) (not (= .cse6 0))))))) (not (= 0 .cse8)) (or (= |c_ULTIMATE.start_aws_linked_list_rend_~list#1.base| .cse8) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse8))) (= .cse9 (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_7) |c_ULTIMATE.start_aws_linked_list_rend_~list#1.base| (store .cse9 .cse10 .cse8)) .cse8))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| Int)) (let ((.cse13 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| 24))) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53|) .cse13))) (and (not (= .cse11 0)) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse11))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| (store .cse12 .cse13 .cse11)) .cse11) .cse12))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| Int)) (let ((.cse14 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| 24)))) (and (not (= .cse14 0)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| .cse14))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24| Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| 24)))) (and (= .cse15 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24|) (not (= .cse15 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24| Int)) (let ((.cse18 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse16 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24|) .cse18))) (and (not (= .cse16 0)) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse17 (select |c_#memory_$Pointer$#2.base| .cse16))) (= .cse17 (select (store (store |c_#memory_$Pointer$#2.base| .cse16 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24| (store .cse17 .cse18 .cse16)) .cse16)))))))))))) is different from true [2024-11-13 13:21:53,738 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_18| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25|) .cse2))) (and (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25| (store .cse1 .cse2 .cse0)) .cse0) .cse1))) (not (= .cse0 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_18| 24)))) (and (= .cse3 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25|) (not (= .cse3 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| 24)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) (not (= .cse4 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) .cse7))) (and (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse6))) (= .cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| (store .cse5 .cse7 .cse6)) .cse6)))) (not (= .cse6 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| 24))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53|) .cse10))) (and (not (= .cse8 0)) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse8))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| (store .cse9 .cse10 .cse8)) .cse8) .cse9))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| 24)))) (and (not (= .cse11 0)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| .cse11))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| 24)))) (and (= .cse12 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24|) (not (= .cse12 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24| Int)) (let ((.cse15 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24|) .cse15))) (and (not (= .cse13 0)) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| .cse13))) (= .cse14 (select (store (store |c_#memory_$Pointer$#2.base| .cse13 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24| (store .cse14 .cse15 .cse13)) .cse13))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_26| Int)) (let ((.cse18 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_19| 24))) (let ((.cse16 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_26|) .cse18))) (and (not (= .cse16 0)) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse17 (select |c_#memory_$Pointer$#2.base| .cse16))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse16 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_26| (store .cse17 .cse18 .cse16)) .cse16) .cse17))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_26| Int)) (let ((.cse19 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_26|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_19| 24)))) (and (not (= .cse19 0)) (= .cse19 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_26|)))))) is different from true [2024-11-13 13:21:54,622 WARN L873 $PredicateComparison]: unable to prove that (and (or |c_aws_linked_list_is_valid_#t~short308#1| (= 0 (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_18| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25|) .cse2))) (and (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25| (store .cse1 .cse2 .cse0)) .cse0) .cse1))) (not (= .cse0 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_18| 24)))) (and (= .cse3 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25|) (not (= .cse3 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| 24)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) (not (= .cse4 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) .cse7))) (and (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse6))) (= .cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| (store .cse5 .cse7 .cse6)) .cse6)))) (not (= .cse6 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| 24))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53|) .cse10))) (and (not (= .cse8 0)) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse8))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| (store .cse9 .cse10 .cse8)) .cse8) .cse9))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| 24)))) (and (not (= .cse11 0)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| .cse11))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| 24)))) (and (= .cse12 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24|) (not (= .cse12 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24| Int)) (let ((.cse15 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24|) .cse15))) (and (not (= .cse13 0)) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| .cse13))) (= .cse14 (select (store (store |c_#memory_$Pointer$#2.base| .cse13 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24| (store .cse14 .cse15 .cse13)) .cse13))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_26| Int)) (let ((.cse18 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_19| 24))) (let ((.cse16 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_26|) .cse18))) (and (not (= .cse16 0)) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse17 (select |c_#memory_$Pointer$#2.base| .cse16))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse16 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_26| (store .cse17 .cse18 .cse16)) .cse16) .cse17))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_26| Int)) (let ((.cse19 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_26|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_19| 24)))) (and (not (= .cse19 0)) (= .cse19 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_26|)))))) is different from true [2024-11-13 13:21:54,710 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_18| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25|) .cse2))) (and (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25| (store .cse1 .cse2 .cse0)) .cse0) .cse1))) (not (= .cse0 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_18| 24)))) (and (= .cse3 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25|) (not (= .cse3 0)))))) (or |c_aws_linked_list_is_valid_#t~short310#1| (= 0 (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| 24)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) (not (= .cse4 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) .cse7))) (and (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse6))) (= .cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| (store .cse5 .cse7 .cse6)) .cse6)))) (not (= .cse6 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| 24))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53|) .cse10))) (and (not (= .cse8 0)) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse8))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| (store .cse9 .cse10 .cse8)) .cse8) .cse9))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| 24)))) (and (not (= .cse11 0)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| .cse11))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| 24)))) (and (= .cse12 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24|) (not (= .cse12 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24| Int)) (let ((.cse15 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24|) .cse15))) (and (not (= .cse13 0)) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| .cse13))) (= .cse14 (select (store (store |c_#memory_$Pointer$#2.base| .cse13 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24| (store .cse14 .cse15 .cse13)) .cse13))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_26| Int)) (let ((.cse18 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_19| 24))) (let ((.cse16 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_26|) .cse18))) (and (not (= .cse16 0)) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse17 (select |c_#memory_$Pointer$#2.base| .cse16))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse16 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_26| (store .cse17 .cse18 .cse16)) .cse16) .cse17))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_26| Int)) (let ((.cse19 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_26|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_19| 24)))) (and (not (= .cse19 0)) (= .cse19 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_26|)))))) is different from true [2024-11-13 13:21:54,951 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_18| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25|) .cse2))) (and (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25| (store .cse1 .cse2 .cse0)) .cse0) .cse1))) (not (= .cse0 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_18| 24)))) (and (= .cse3 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_25|) (not (= .cse3 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| 24)))) (and (= .cse4 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) (not (= .cse4 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52|) .cse7))) (and (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse6))) (= .cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_52| (store .cse5 .cse7 .cse6)) .cse6)))) (not (= .cse6 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| 24))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53|) .cse10))) (and (not (= .cse8 0)) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse8))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| (store .cse9 .cse10 .cse8)) .cse8) .cse9))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| 24)))) (and (not (= .cse11 0)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_53| .cse11))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| 24)))) (and (= .cse12 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24|) (not (= .cse12 0))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24| Int)) (let ((.cse15 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24|) .cse15))) (and (not (= .cse13 0)) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| .cse13))) (= .cse14 (select (store (store |c_#memory_$Pointer$#2.base| .cse13 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_24| (store .cse14 .cse15 .cse13)) .cse13))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_26| Int)) (let ((.cse18 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_19| 24))) (let ((.cse16 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_26|) .cse18))) (and (not (= .cse16 0)) (exists ((v_DerPreprocessor_7 (Array Int Int))) (let ((.cse17 (select |c_#memory_$Pointer$#2.base| .cse16))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse16 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_26| (store .cse17 .cse18 .cse16)) .cse16) .cse17))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_26| Int)) (let ((.cse19 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_26|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_19| 24)))) (and (not (= .cse19 0)) (= .cse19 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_26|))))) (= 0 (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)))) is different from true [2024-11-13 13:21:55,202 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 37 not checked. [2024-11-13 13:21:55,202 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:21:55,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:21:55,653 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 334 treesize of output 327 [2024-11-13 13:21:55,660 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 172 treesize of output 156 [2024-11-13 13:21:55,747 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-13 13:21:55,752 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-13 13:21:55,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-13 13:21:55,835 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-13 13:21:55,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422752789] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 13:21:55,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:21:55,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6, 19] total 29 [2024-11-13 13:21:55,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389954655] [2024-11-13 13:21:55,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:21:55,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 13:21:55,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:21:55,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 13:21:55,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=208, Unknown=23, NotChecked=520, Total=812 [2024-11-13 13:21:55,837 INFO L87 Difference]: Start difference. First operand 129 states and 160 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-13 13:21:56,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:21:56,400 INFO L93 Difference]: Finished difference Result 204 states and 262 transitions. [2024-11-13 13:21:56,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 13:21:56,400 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 88 [2024-11-13 13:21:56,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:21:56,402 INFO L225 Difference]: With dead ends: 204 [2024-11-13 13:21:56,402 INFO L226 Difference]: Without dead ends: 131 [2024-11-13 13:21:56,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=294, Unknown=25, NotChecked=598, Total=992 [2024-11-13 13:21:56,404 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 58 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:21:56,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 494 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:21:56,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-13 13:21:56,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-13 13:21:56,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 93 states have (on average 1.1935483870967742) internal successors, (111), 96 states have internal predecessors, (111), 25 states have call successors, (25), 11 states have call predecessors, (25), 12 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2024-11-13 13:21:56,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 162 transitions. [2024-11-13 13:21:56,437 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 162 transitions. Word has length 88 [2024-11-13 13:21:56,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:21:56,437 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 162 transitions. [2024-11-13 13:21:56,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-13 13:21:56,438 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2024-11-13 13:21:56,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-13 13:21:56,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:21:56,439 INFO L215 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] [2024-11-13 13:21:56,464 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 13:21:56,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 13:21:56,640 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:21:56,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:21:56,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1664919232, now seen corresponding path program 1 times [2024-11-13 13:21:56,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:21:56,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185687760] [2024-11-13 13:21:56,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:56,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:21:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:56,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:21:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:56,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:21:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:56,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:21:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:56,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:21:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:56,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 13:21:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:56,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-13 13:21:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:56,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:21:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:57,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 13:21:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:57,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 13:21:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:57,062 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 13:21:57,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:21:57,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185687760] [2024-11-13 13:21:57,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185687760] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:21:57,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246615630] [2024-11-13 13:21:57,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:21:57,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:21:57,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:21:57,066 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:21:57,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 13:21:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:21:57,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-13 13:21:57,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:21:57,700 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-13 13:21:57,736 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-13 13:21:57,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:21:57,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:21:57,825 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-13 13:21:57,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:21:57,834 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-13 13:21:57,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:21:57,853 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-13 13:21:57,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:21:57,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 13:21:57,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:21:57,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:21:57,970 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 47 treesize of output 42 [2024-11-13 13:21:57,976 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-13 13:21:57,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:21:57,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:21:57,996 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 38 treesize of output 35 [2024-11-13 13:21:58,006 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 24 treesize of output 13 [2024-11-13 13:22:00,045 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-13 13:22:00,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:22:00,568 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 8 |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|))) (and (forall ((v_ArrVal_1164 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1164))) (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 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_1162 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1162))) (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 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2024-11-13 13:22:00,652 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 8 |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| 1)) (forall ((v_ArrVal_1161 Int) (v_subst_2 Int) (v_ArrVal_1162 (Array Int Int))) (= (select (select (let ((.cse0 (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_1161)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| v_ArrVal_1162))) (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_subst_2))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| 1)) (forall ((v_ArrVal_1158 Int) (v_ArrVal_1164 (Array Int Int))) (= (select (select (let ((.cse3 (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_1158)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| v_ArrVal_1164))) (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_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0)))))) is different from false [2024-11-13 13:22:00,678 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:00,679 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:00,840 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2024-11-13 13:22:00,841 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 171 treesize of output 200 [2024-11-13 13:22:00,859 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:00,860 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:22:00,982 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2024-11-13 13:22:00,982 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 327 treesize of output 314 [2024-11-13 13:22:01,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:22:01,012 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 260 treesize of output 258 [2024-11-13 13:22:01,026 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 217 treesize of output 205 [2024-11-13 13:22:01,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:22:01,055 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 296 [2024-11-13 13:22:01,076 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 263 treesize of output 251 [2024-11-13 13:22:01,944 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-13 13:22:01,986 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-13 13:22:02,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:22:02,123 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 92 treesize of output 94 [2024-11-13 13:22:02,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:22:02,209 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 33 treesize of output 33 [2024-11-13 13:22:02,291 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-13 13:22:02,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246615630] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:22:02,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:22:02,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 11] total 25 [2024-11-13 13:22:02,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840118029] [2024-11-13 13:22:02,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:22:02,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-13 13:22:02,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:22:02,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-13 13:22:02,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=442, Unknown=2, NotChecked=86, Total=600 [2024-11-13 13:22:02,295 INFO L87 Difference]: Start difference. First operand 131 states and 162 transitions. Second operand has 25 states, 24 states have (on average 4.916666666666667) internal successors, (118), 24 states have internal predecessors, (118), 10 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 10 states have call predecessors, (25), 10 states have call successors, (25) [2024-11-13 13:22:04,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:22:04,976 INFO L93 Difference]: Finished difference Result 214 states and 273 transitions. [2024-11-13 13:22:04,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 13:22:04,976 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.916666666666667) internal successors, (118), 24 states have internal predecessors, (118), 10 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 10 states have call predecessors, (25), 10 states have call successors, (25) Word has length 88 [2024-11-13 13:22:04,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:22:04,978 INFO L225 Difference]: With dead ends: 214 [2024-11-13 13:22:04,978 INFO L226 Difference]: Without dead ends: 135 [2024-11-13 13:22:04,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 169 SyntacticMatches, 9 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=179, Invalid=1159, Unknown=2, NotChecked=142, Total=1482 [2024-11-13 13:22:04,980 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 84 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 282 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:22:04,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1227 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 880 Invalid, 0 Unknown, 282 Unchecked, 1.7s Time] [2024-11-13 13:22:04,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-13 13:22:05,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2024-11-13 13:22:05,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 95 states have (on average 1.1894736842105262) internal successors, (113), 98 states have internal predecessors, (113), 25 states have call successors, (25), 11 states have call predecessors, (25), 12 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2024-11-13 13:22:05,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 163 transitions. [2024-11-13 13:22:05,011 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 163 transitions. Word has length 88 [2024-11-13 13:22:05,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:22:05,012 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 163 transitions. [2024-11-13 13:22:05,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.916666666666667) internal successors, (118), 24 states have internal predecessors, (118), 10 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 10 states have call predecessors, (25), 10 states have call successors, (25) [2024-11-13 13:22:05,012 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 163 transitions. [2024-11-13 13:22:05,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 13:22:05,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:22:05,014 INFO L215 NwaCegarLoop]: trace histogram [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-13 13:22:05,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-13 13:22:05,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-13 13:22:05,218 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:22:05,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:22:05,219 INFO L85 PathProgramCache]: Analyzing trace with hash -122010389, now seen corresponding path program 1 times [2024-11-13 13:22:05,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:22:05,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378033645] [2024-11-13 13:22:05,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:22:05,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:22:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:05,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:22:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:05,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:22:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:05,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:22:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:05,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:22:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:05,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 13:22:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:05,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:22:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:05,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:22:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:05,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 13:22:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:05,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 13:22:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:05,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:22:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:05,987 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-13 13:22:05,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:22:05,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378033645] [2024-11-13 13:22:05,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378033645] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:22:05,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795944786] [2024-11-13 13:22:05,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:22:05,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:22:05,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:22:05,991 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:22:05,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 13:22:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:06,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-13 13:22:06,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:22:06,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-13 13:22:06,741 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-13 13:22:08,961 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 79 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 13:22:08,961 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:22:10,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:22:10,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 940 treesize of output 921 [2024-11-13 13:22:10,905 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 1134 treesize of output 1098 [2024-11-13 13:22:13,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:22:14,009 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 668 treesize of output 660 [2024-11-13 13:22:14,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:22:14,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:22:14,401 INFO L349 Elim1Store]: treesize reduction 332, result has 21.9 percent of original size [2024-11-13 13:22:14,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 29 case distinctions, treesize of input 4408 treesize of output 3936 [2024-11-13 13:22:14,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:22:14,583 INFO L349 Elim1Store]: treesize reduction 85, result has 35.6 percent of original size [2024-11-13 13:22:14,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 242 treesize of output 228 [2024-11-13 13:22:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 22 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 13:22:15,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795944786] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:22:15,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:22:15,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 19, 14] total 35 [2024-11-13 13:22:15,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013469051] [2024-11-13 13:22:15,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:22:15,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-13 13:22:15,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:22:15,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-13 13:22:15,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1086, Unknown=0, NotChecked=0, Total=1190 [2024-11-13 13:22:15,092 INFO L87 Difference]: Start difference. First operand 133 states and 163 transitions. Second operand has 35 states, 32 states have (on average 4.6875) internal successors, (150), 31 states have internal predecessors, (150), 12 states have call successors, (26), 3 states have call predecessors, (26), 11 states have return successors, (25), 10 states have call predecessors, (25), 12 states have call successors, (25) [2024-11-13 13:22:19,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:22:19,506 INFO L93 Difference]: Finished difference Result 273 states and 349 transitions. [2024-11-13 13:22:19,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-13 13:22:19,507 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 4.6875) internal successors, (150), 31 states have internal predecessors, (150), 12 states have call successors, (26), 3 states have call predecessors, (26), 11 states have return successors, (25), 10 states have call predecessors, (25), 12 states have call successors, (25) Word has length 107 [2024-11-13 13:22:19,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:22:19,509 INFO L225 Difference]: With dead ends: 273 [2024-11-13 13:22:19,509 INFO L226 Difference]: Without dead ends: 164 [2024-11-13 13:22:19,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 204 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=291, Invalid=2901, Unknown=0, NotChecked=0, Total=3192 [2024-11-13 13:22:19,512 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 65 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:22:19,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1525 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-13 13:22:19,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-13 13:22:19,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 144. [2024-11-13 13:22:19,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 102 states have (on average 1.1764705882352942) internal successors, (120), 108 states have internal predecessors, (120), 26 states have call successors, (26), 11 states have call predecessors, (26), 15 states have return successors, (34), 24 states have call predecessors, (34), 24 states have call successors, (34) [2024-11-13 13:22:19,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 180 transitions. [2024-11-13 13:22:19,557 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 180 transitions. Word has length 107 [2024-11-13 13:22:19,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:22:19,557 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 180 transitions. [2024-11-13 13:22:19,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 4.6875) internal successors, (150), 31 states have internal predecessors, (150), 12 states have call successors, (26), 3 states have call predecessors, (26), 11 states have return successors, (25), 10 states have call predecessors, (25), 12 states have call successors, (25) [2024-11-13 13:22:19,557 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 180 transitions. [2024-11-13 13:22:19,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 13:22:19,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:22:19,558 INFO L215 NwaCegarLoop]: trace histogram [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, 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-13 13:22:19,575 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-13 13:22:19,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-13 13:22:19,759 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:22:19,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:22:19,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1759334652, now seen corresponding path program 1 times [2024-11-13 13:22:19,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:22:19,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538098278] [2024-11-13 13:22:19,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:22:19,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:22:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:20,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:22:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:20,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:22:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:20,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:22:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:20,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:22:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:20,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 13:22:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:20,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:22:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:20,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:22:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:20,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:22:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:20,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:22:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:20,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:22:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-13 13:22:20,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:22:20,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538098278] [2024-11-13 13:22:20,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538098278] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:22:20,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309953360] [2024-11-13 13:22:20,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:22:20,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:22:20,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:22:20,806 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:22:20,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-13 13:22:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:21,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-13 13:22:21,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:22:21,389 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-13 13:22:22,893 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-13 13:22:22,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 16 [2024-11-13 13:22:22,900 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 78 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 13:22:22,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:22:23,489 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 78 treesize of output 74 [2024-11-13 13:22:23,841 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-13 13:22:23,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309953360] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:22:23,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:22:23,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 12] total 32 [2024-11-13 13:22:23,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675853647] [2024-11-13 13:22:23,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:22:23,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-13 13:22:23,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:22:23,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-13 13:22:23,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=900, Unknown=0, NotChecked=0, Total=992 [2024-11-13 13:22:23,844 INFO L87 Difference]: Start difference. First operand 144 states and 180 transitions. Second operand has 32 states, 30 states have (on average 5.2) internal successors, (156), 32 states have internal predecessors, (156), 12 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 9 states have call predecessors, (25), 12 states have call successors, (25) [2024-11-13 13:22:27,865 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-13 13:22:32,019 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-13 13:22:36,116 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-13 13:22:40,224 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-13 13:22:44,238 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-13 13:22:48,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:22:48,248 INFO L93 Difference]: Finished difference Result 339 states and 468 transitions. [2024-11-13 13:22:48,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-13 13:22:48,249 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 5.2) internal successors, (156), 32 states have internal predecessors, (156), 12 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 9 states have call predecessors, (25), 12 states have call successors, (25) Word has length 109 [2024-11-13 13:22:48,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:22:48,252 INFO L225 Difference]: With dead ends: 339 [2024-11-13 13:22:48,252 INFO L226 Difference]: Without dead ends: 212 [2024-11-13 13:22:48,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 221 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=451, Invalid=3839, Unknown=0, NotChecked=0, Total=4290 [2024-11-13 13:22:48,255 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 287 mSDsluCounter, 1386 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 63 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:22:48,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 1470 Invalid, 1425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1357 Invalid, 5 Unknown, 0 Unchecked, 22.4s Time] [2024-11-13 13:22:48,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-13 13:22:48,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 163. [2024-11-13 13:22:48,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 118 states have (on average 1.1779661016949152) internal successors, (139), 126 states have internal predecessors, (139), 27 states have call successors, (27), 11 states have call predecessors, (27), 17 states have return successors, (37), 25 states have call predecessors, (37), 25 states have call successors, (37) [2024-11-13 13:22:48,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 203 transitions. [2024-11-13 13:22:48,307 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 203 transitions. Word has length 109 [2024-11-13 13:22:48,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:22:48,307 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 203 transitions. [2024-11-13 13:22:48,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 5.2) internal successors, (156), 32 states have internal predecessors, (156), 12 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 9 states have call predecessors, (25), 12 states have call successors, (25) [2024-11-13 13:22:48,307 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 203 transitions. [2024-11-13 13:22:48,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 13:22:48,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:22:48,310 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:22:48,336 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-13 13:22:48,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:22:48,511 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:22:48,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:22:48,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1489744343, now seen corresponding path program 1 times [2024-11-13 13:22:48,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:22:48,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28658459] [2024-11-13 13:22:48,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:22:48,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:22:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:49,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:22:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:49,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:22:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:49,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:22:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:49,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:22:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:49,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 13:22:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:49,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-13 13:22:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:50,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:22:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:50,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-13 13:22:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:50,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-13 13:22:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:50,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 13:22:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-13 13:22:50,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:22:50,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28658459] [2024-11-13 13:22:50,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28658459] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:22:50,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759400326] [2024-11-13 13:22:50,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:22:50,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:22:50,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:22:50,235 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:22:50,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-13 13:22:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:22:50,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-13 13:22:50,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:22:50,752 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-13 13:22:50,756 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-13 13:22:55,153 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_5| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_5| Int)) (not (= (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_5|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_5|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_5| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_5| Int)) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_5|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_5|) 0)))) is different from true [2024-11-13 13:22:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 13:22:56,344 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:22:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 29 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 13:22:57,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759400326] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:22:57,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:22:57,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 11] total 37 [2024-11-13 13:22:57,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104672126] [2024-11-13 13:22:57,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:22:57,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-13 13:22:57,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:22:57,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-13 13:22:57,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1156, Unknown=1, NotChecked=68, Total=1332 [2024-11-13 13:22:57,224 INFO L87 Difference]: Start difference. First operand 163 states and 203 transitions. Second operand has 37 states, 36 states have (on average 4.0) internal successors, (144), 36 states have internal predecessors, (144), 11 states have call successors, (26), 4 states have call predecessors, (26), 8 states have return successors, (26), 9 states have call predecessors, (26), 11 states have call successors, (26) [2024-11-13 13:23:01,267 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-13 13:23:05,320 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-13 13:23:09,379 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-13 13:23:35,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:23:35,382 INFO L93 Difference]: Finished difference Result 557 states and 734 transitions. [2024-11-13 13:23:35,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-11-13 13:23:35,383 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 4.0) internal successors, (144), 36 states have internal predecessors, (144), 11 states have call successors, (26), 4 states have call predecessors, (26), 8 states have return successors, (26), 9 states have call predecessors, (26), 11 states have call successors, (26) Word has length 103 [2024-11-13 13:23:35,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:23:35,386 INFO L225 Difference]: With dead ends: 557 [2024-11-13 13:23:35,386 INFO L226 Difference]: Without dead ends: 403 [2024-11-13 13:23:35,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 218 SyntacticMatches, 8 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 29.3s TimeCoverageRelationStatistics Valid=605, Invalid=6035, Unknown=6, NotChecked=160, Total=6806 [2024-11-13 13:23:35,390 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 300 mSDsluCounter, 1780 mSDsCounter, 0 mSdLazyCounter, 2041 mSolverCounterSat, 126 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 2041 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 303 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:23:35,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1874 Invalid, 2473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 2041 Invalid, 3 Unknown, 303 Unchecked, 14.8s Time] [2024-11-13 13:23:35,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-13 13:23:35,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 336. [2024-11-13 13:23:35,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 253 states have (on average 1.209486166007905) internal successors, (306), 263 states have internal predecessors, (306), 50 states have call successors, (50), 22 states have call predecessors, (50), 32 states have return successors, (76), 50 states have call predecessors, (76), 47 states have call successors, (76) [2024-11-13 13:23:35,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 432 transitions. [2024-11-13 13:23:35,483 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 432 transitions. Word has length 103 [2024-11-13 13:23:35,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:23:35,484 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 432 transitions. [2024-11-13 13:23:35,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 4.0) internal successors, (144), 36 states have internal predecessors, (144), 11 states have call successors, (26), 4 states have call predecessors, (26), 8 states have return successors, (26), 9 states have call predecessors, (26), 11 states have call successors, (26) [2024-11-13 13:23:35,484 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 432 transitions. [2024-11-13 13:23:35,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 13:23:35,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:23:35,487 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:23:35,512 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-13 13:23:35,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:23:35,687 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:23:35,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:23:35,688 INFO L85 PathProgramCache]: Analyzing trace with hash -494069289, now seen corresponding path program 1 times [2024-11-13 13:23:35,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:23:35,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911957282] [2024-11-13 13:23:35,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:23:35,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:23:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:35,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:23:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:35,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:23:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:35,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:23:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:35,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:23:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:35,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 13:23:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:35,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-13 13:23:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:35,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:23:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:35,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-13 13:23:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:35,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-13 13:23:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:35,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 13:23:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:35,906 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 13:23:35,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:23:35,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911957282] [2024-11-13 13:23:35,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911957282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:23:35,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582544034] [2024-11-13 13:23:35,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:23:35,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:23:35,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:23:35,910 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:23:35,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-13 13:23:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:36,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 13:23:36,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:23:36,365 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-13 13:23:36,365 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:23:36,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582544034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:23:36,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:23:36,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-13 13:23:36,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496651980] [2024-11-13 13:23:36,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:23:36,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:23:36,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:23:36,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:23:36,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:23:36,369 INFO L87 Difference]: Start difference. First operand 336 states and 432 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-13 13:23:36,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:23:36,497 INFO L93 Difference]: Finished difference Result 523 states and 682 transitions. [2024-11-13 13:23:36,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:23:36,497 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 103 [2024-11-13 13:23:36,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:23:36,500 INFO L225 Difference]: With dead ends: 523 [2024-11-13 13:23:36,500 INFO L226 Difference]: Without dead ends: 332 [2024-11-13 13:23:36,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 125 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-13 13:23:36,505 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:23:36,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 223 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:23:36,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-13 13:23:36,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2024-11-13 13:23:36,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 249 states have (on average 1.2048192771084338) internal successors, (300), 259 states have internal predecessors, (300), 50 states have call successors, (50), 22 states have call predecessors, (50), 32 states have return successors, (76), 50 states have call predecessors, (76), 47 states have call successors, (76) [2024-11-13 13:23:36,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 426 transitions. [2024-11-13 13:23:36,618 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 426 transitions. Word has length 103 [2024-11-13 13:23:36,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:23:36,618 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 426 transitions. [2024-11-13 13:23:36,619 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-13 13:23:36,619 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 426 transitions. [2024-11-13 13:23:36,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 13:23:36,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:23:36,621 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:23:36,649 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-13 13:23:36,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:23:36,822 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:23:36,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:23:36,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1652090473, now seen corresponding path program 1 times [2024-11-13 13:23:36,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:23:36,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853590013] [2024-11-13 13:23:36,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:23:36,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:23:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:36,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:23:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:36,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:23:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:36,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:23:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:36,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:23:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:36,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 13:23:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:36,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-13 13:23:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:37,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:23:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:37,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-13 13:23:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:37,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-13 13:23:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:37,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 13:23:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:37,045 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-13 13:23:37,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:23:37,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853590013] [2024-11-13 13:23:37,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853590013] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:23:37,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659505609] [2024-11-13 13:23:37,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:23:37,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:23:37,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:23:37,049 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:23:37,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-13 13:23:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:37,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 13:23:37,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:23:37,507 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-13 13:23:37,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:23:37,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659505609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:23:37,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:23:37,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-13 13:23:37,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560942102] [2024-11-13 13:23:37,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:23:37,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:23:37,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:23:37,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:23:37,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:23:37,509 INFO L87 Difference]: Start difference. First operand 332 states and 426 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-13 13:23:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:23:37,618 INFO L93 Difference]: Finished difference Result 440 states and 548 transitions. [2024-11-13 13:23:37,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:23:37,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 103 [2024-11-13 13:23:37,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:23:37,622 INFO L225 Difference]: With dead ends: 440 [2024-11-13 13:23:37,622 INFO L226 Difference]: Without dead ends: 246 [2024-11-13 13:23:37,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 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-13 13:23:37,633 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 1 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:23:37,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 223 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:23:37,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-13 13:23:37,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 243. [2024-11-13 13:23:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 188 states have (on average 1.1914893617021276) internal successors, (224), 194 states have internal predecessors, (224), 30 states have call successors, (30), 18 states have call predecessors, (30), 24 states have return successors, (40), 30 states have call predecessors, (40), 28 states have call successors, (40) [2024-11-13 13:23:37,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 294 transitions. [2024-11-13 13:23:37,735 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 294 transitions. Word has length 103 [2024-11-13 13:23:37,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:23:37,736 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 294 transitions. [2024-11-13 13:23:37,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-13 13:23:37,737 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 294 transitions. [2024-11-13 13:23:37,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 13:23:37,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:23:37,739 INFO L215 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, 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-13 13:23:37,765 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-13 13:23:37,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-13 13:23:37,940 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:23:37,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:23:37,941 INFO L85 PathProgramCache]: Analyzing trace with hash 2097521945, now seen corresponding path program 1 times [2024-11-13 13:23:37,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:23:37,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419160925] [2024-11-13 13:23:37,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:23:37,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:23:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:38,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:23:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:38,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:23:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:38,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:23:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:38,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:23:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:38,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 13:23:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:38,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 13:23:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:38,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:23:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:38,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-13 13:23:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:38,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-13 13:23:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:38,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:23:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:38,415 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-13 13:23:38,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:23:38,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419160925] [2024-11-13 13:23:38,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419160925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:23:38,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232682523] [2024-11-13 13:23:38,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:23:38,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:23:38,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:23:38,419 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:23:38,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-13 13:23:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:38,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 13:23:38,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:23:39,128 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-13 13:23:39,128 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:23:39,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232682523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:23:39,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:23:39,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2024-11-13 13:23:39,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015183539] [2024-11-13 13:23:39,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:23:39,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 13:23:39,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:23:39,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 13:23:39,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-13 13:23:39,130 INFO L87 Difference]: Start difference. First operand 243 states and 294 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-13 13:23:39,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:23:39,738 INFO L93 Difference]: Finished difference Result 488 states and 622 transitions. [2024-11-13 13:23:39,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 13:23:39,738 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 110 [2024-11-13 13:23:39,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:23:39,741 INFO L225 Difference]: With dead ends: 488 [2024-11-13 13:23:39,741 INFO L226 Difference]: Without dead ends: 312 [2024-11-13 13:23:39,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2024-11-13 13:23:39,745 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 100 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:23:39,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 351 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:23:39,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-13 13:23:39,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 280. [2024-11-13 13:23:39,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 217 states have (on average 1.2027649769585254) internal successors, (261), 226 states have internal predecessors, (261), 32 states have call successors, (32), 18 states have call predecessors, (32), 30 states have return successors, (56), 35 states have call predecessors, (56), 30 states have call successors, (56) [2024-11-13 13:23:39,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 349 transitions. [2024-11-13 13:23:39,853 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 349 transitions. Word has length 110 [2024-11-13 13:23:39,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:23:39,855 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 349 transitions. [2024-11-13 13:23:39,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-13 13:23:39,855 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 349 transitions. [2024-11-13 13:23:39,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 13:23:39,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:23:39,861 INFO L215 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, 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-13 13:23:39,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-13 13:23:40,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-13 13:23:40,062 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:23:40,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:23:40,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1974386553, now seen corresponding path program 1 times [2024-11-13 13:23:40,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:23:40,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098319219] [2024-11-13 13:23:40,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:23:40,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:23:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:40,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:23:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:40,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:23:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:40,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:23:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:40,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:23:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:40,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 13:23:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:40,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-13 13:23:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:40,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:23:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:40,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:23:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:40,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 13:23:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:40,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:23:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:40,281 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-13 13:23:40,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:23:40,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098319219] [2024-11-13 13:23:40,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098319219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:23:40,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:23:40,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:23:40,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128575147] [2024-11-13 13:23:40,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:23:40,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:23:40,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:23:40,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:23:40,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:23:40,283 INFO L87 Difference]: Start difference. First operand 280 states and 349 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:23:40,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:23:40,415 INFO L93 Difference]: Finished difference Result 491 states and 645 transitions. [2024-11-13 13:23:40,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:23:40,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 111 [2024-11-13 13:23:40,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:23:40,419 INFO L225 Difference]: With dead ends: 491 [2024-11-13 13:23:40,419 INFO L226 Difference]: Without dead ends: 267 [2024-11-13 13:23:40,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-13 13:23:40,421 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:23:40,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:23:40,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-13 13:23:40,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-11-13 13:23:40,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 208 states have (on average 1.1826923076923077) internal successors, (246), 214 states have internal predecessors, (246), 32 states have call successors, (32), 18 states have call predecessors, (32), 26 states have return successors, (48), 34 states have call predecessors, (48), 30 states have call successors, (48) [2024-11-13 13:23:40,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 326 transitions. [2024-11-13 13:23:40,516 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 326 transitions. Word has length 111 [2024-11-13 13:23:40,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:23:40,516 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 326 transitions. [2024-11-13 13:23:40,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:23:40,517 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 326 transitions. [2024-11-13 13:23:40,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 13:23:40,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:23:40,518 INFO L215 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, 1] [2024-11-13 13:23:40,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-13 13:23:40,519 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:23:40,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:23:40,519 INFO L85 PathProgramCache]: Analyzing trace with hash -963269303, now seen corresponding path program 1 times [2024-11-13 13:23:40,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:23:40,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026801135] [2024-11-13 13:23:40,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:23:40,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:23:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:41,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:23:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:41,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:23:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:41,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:23:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:41,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:23:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:41,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-13 13:23:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:41,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-13 13:23:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:41,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:23:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:41,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 13:23:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:41,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 13:23:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:41,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:23:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:41,970 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 18 proven. 21 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-13 13:23:41,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:23:41,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026801135] [2024-11-13 13:23:41,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026801135] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:23:41,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566612955] [2024-11-13 13:23:41,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:23:41,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:23:41,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:23:41,974 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:23:41,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-13 13:23:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:23:42,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-13 13:23:42,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:23:42,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:23:42,712 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-13 13:23:42,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:23:42,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:23:42,722 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-13 13:23:42,728 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-13 13:23:46,774 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_89| Int)) (<= (+ (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_89|) 24) 2) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_89|)) is different from true [2024-11-13 13:23:51,033 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_90| Int)) (<= (+ 2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_90|) 24)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_90|)) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_89| Int)) (<= (+ (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_89|) 24) 2) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_89|))) is different from true [2024-11-13 13:23:51,294 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 62 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 13:23:51,294 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:23:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 18 proven. 29 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-13 13:23:53,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566612955] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:23:53,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:23:53,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 34 [2024-11-13 13:23:53,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16523366] [2024-11-13 13:23:53,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:23:53,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-13 13:23:53,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:23:53,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-13 13:23:53,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=911, Unknown=2, NotChecked=122, Total=1122 [2024-11-13 13:23:53,261 INFO L87 Difference]: Start difference. First operand 267 states and 326 transitions. Second operand has 34 states, 30 states have (on average 4.933333333333334) internal successors, (148), 30 states have internal predecessors, (148), 13 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (24), 11 states have call predecessors, (24), 13 states have call successors, (24) [2024-11-13 13:23:57,392 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-13 13:24:23,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] [2024-11-13 13:24:35,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:24:48,498 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-13 13:24:53,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:24:53,233 INFO L93 Difference]: Finished difference Result 541 states and 697 transitions. [2024-11-13 13:24:53,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-13 13:24:53,234 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 4.933333333333334) internal successors, (148), 30 states have internal predecessors, (148), 13 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (24), 11 states have call predecessors, (24), 13 states have call successors, (24) Word has length 111 [2024-11-13 13:24:53,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:24:53,237 INFO L225 Difference]: With dead ends: 541 [2024-11-13 13:24:53,237 INFO L226 Difference]: Without dead ends: 357 [2024-11-13 13:24:53,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 51.1s TimeCoverageRelationStatistics Valid=217, Invalid=2131, Unknown=12, NotChecked=190, Total=2550 [2024-11-13 13:24:53,240 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 73 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 1408 mSolverCounterSat, 60 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 2090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1408 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 618 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:24:53,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1381 Invalid, 2090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1408 Invalid, 4 Unknown, 618 Unchecked, 18.5s Time] [2024-11-13 13:24:53,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-13 13:24:53,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 308. [2024-11-13 13:24:53,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 237 states have (on average 1.1814345991561181) internal successors, (280), 243 states have internal predecessors, (280), 40 states have call successors, (40), 18 states have call predecessors, (40), 30 states have return successors, (67), 46 states have call predecessors, (67), 38 states have call successors, (67) [2024-11-13 13:24:53,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 387 transitions. [2024-11-13 13:24:53,359 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 387 transitions. Word has length 111 [2024-11-13 13:24:53,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:24:53,359 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 387 transitions. [2024-11-13 13:24:53,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 4.933333333333334) internal successors, (148), 30 states have internal predecessors, (148), 13 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (24), 11 states have call predecessors, (24), 13 states have call successors, (24) [2024-11-13 13:24:53,360 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 387 transitions. [2024-11-13 13:24:53,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 13:24:53,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:24:53,362 INFO L215 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, 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] [2024-11-13 13:24:53,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-13 13:24:53,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-13 13:24:53,563 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:24:53,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:24:53,564 INFO L85 PathProgramCache]: Analyzing trace with hash -59010081, now seen corresponding path program 2 times [2024-11-13 13:24:53,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:24:53,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044835155] [2024-11-13 13:24:53,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:24:53,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:24:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:24:53,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:24:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:24:53,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:24:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:24:53,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:24:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:24:54,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:24:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:24:54,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:24:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:24:54,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:24:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:24:54,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:24:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:24:54,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 13:24:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:24:54,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:24:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:24:54,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 13:24:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:24:54,442 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 25 proven. 37 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-13 13:24:54,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:24:54,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044835155] [2024-11-13 13:24:54,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044835155] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:24:54,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023300199] [2024-11-13 13:24:54,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:24:54,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:24:54,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:24:54,444 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:24:54,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-13 13:24:54,883 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 13:24:54,883 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:24:54,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 13:24:54,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:24:54,989 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-13 13:24:54,989 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:24:54,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023300199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:24:54,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:24:54,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 12 [2024-11-13 13:24:54,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267296030] [2024-11-13 13:24:54,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:24:54,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:24:54,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:24:54,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:24:54,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-13 13:24:54,992 INFO L87 Difference]: Start difference. First operand 308 states and 387 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-13 13:24:55,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:24:55,136 INFO L93 Difference]: Finished difference Result 531 states and 691 transitions. [2024-11-13 13:24:55,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:24:55,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 113 [2024-11-13 13:24:55,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:24:55,140 INFO L225 Difference]: With dead ends: 531 [2024-11-13 13:24:55,140 INFO L226 Difference]: Without dead ends: 255 [2024-11-13 13:24:55,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-13 13:24:55,142 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 2 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:24:55,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 275 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:24:55,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-13 13:24:55,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2024-11-13 13:24:55,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 192 states have (on average 1.1354166666666667) internal successors, (218), 195 states have internal predecessors, (218), 38 states have call successors, (38), 18 states have call predecessors, (38), 23 states have return successors, (50), 40 states have call predecessors, (50), 36 states have call successors, (50) [2024-11-13 13:24:55,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 306 transitions. [2024-11-13 13:24:55,239 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 306 transitions. Word has length 113 [2024-11-13 13:24:55,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:24:55,240 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 306 transitions. [2024-11-13 13:24:55,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-13 13:24:55,240 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 306 transitions. [2024-11-13 13:24:55,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 13:24:55,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:24:55,243 INFO L215 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-13 13:24:55,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-13 13:24:55,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-13 13:24:55,447 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:24:55,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:24:55,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1226143489, now seen corresponding path program 1 times [2024-11-13 13:24:55,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:24:55,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488583765] [2024-11-13 13:24:55,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:24:55,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:24:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:24:55,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:24:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:24:55,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:24:55,788 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 13:24:55,793 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 13:24:55,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-13 13:24:55,811 INFO L407 BasicCegarLoop]: Path program histogram: [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] [2024-11-13 13:24:55,972 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:24:55,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:24:55 BoogieIcfgContainer [2024-11-13 13:24:55,976 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:24:55,978 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:24:55,978 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:24:55,978 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:24:55,979 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:18:03" (3/4) ... [2024-11-13 13:24:55,981 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 13:24:56,179 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 13:24:56,181 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:24:56,186 INFO L158 Benchmark]: Toolchain (without parser) took 417176.25ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 113.0MB in the beginning and 162.2MB in the end (delta: -49.1MB). Peak memory consumption was 286.4MB. Max. memory is 16.1GB. [2024-11-13 13:24:56,186 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 142.6MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:24:56,186 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2915.43ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 86.7MB in the end (delta: 26.4MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. [2024-11-13 13:24:56,186 INFO L158 Benchmark]: Boogie Procedure Inliner took 147.18ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 81.7MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:24:56,186 INFO L158 Benchmark]: Boogie Preprocessor took 106.31ms. Allocated memory is still 142.6MB. Free memory was 81.7MB in the beginning and 78.2MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:24:56,187 INFO L158 Benchmark]: RCFGBuilder took 852.46ms. Allocated memory is still 142.6MB. Free memory was 78.2MB in the beginning and 54.3MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 13:24:56,187 INFO L158 Benchmark]: TraceAbstraction took 412934.77ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 53.6MB in the beginning and 166.4MB in the end (delta: -112.8MB). Peak memory consumption was 224.3MB. Max. memory is 16.1GB. [2024-11-13 13:24:56,187 INFO L158 Benchmark]: Witness Printer took 206.95ms. Allocated memory is still 478.2MB. Free memory was 166.4MB in the beginning and 162.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:24:56,189 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.45ms. Allocated memory is still 142.6MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2915.43ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 86.7MB in the end (delta: 26.4MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 147.18ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 81.7MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.31ms. Allocated memory is still 142.6MB. Free memory was 81.7MB in the beginning and 78.2MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 852.46ms. Allocated memory is still 142.6MB. Free memory was 78.2MB in the beginning and 54.3MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 412934.77ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 53.6MB in the beginning and 166.4MB in the end (delta: -112.8MB). Peak memory consumption was 224.3MB. Max. memory is 16.1GB. * Witness Printer took 206.95ms. Allocated memory is still 478.2MB. Free memory was 166.4MB in the beginning and 162.2MB in the end (delta: 4.2MB). There was no memory consumed. 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_rend_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=((unsigned __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=((unsigned __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_rend(&list) [L4824] 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); [L4824] RET, EXPR aws_linked_list_is_valid(list) VAL [list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4824] 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] [L4824] 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] [L4825] const struct aws_linked_list_node *rval = &list->head; VAL [list={7:0}, rval={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4826] 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); [L4826] 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] [L4826] 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, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 412.7s, OverallIterations: 27, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 290.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 361 mSolverCounterUnknown, 2540 SdHoareTripleChecker+Valid, 169.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2481 mSDsluCounter, 15487 SdHoareTripleChecker+Invalid, 166.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1471 IncrementalHoareTripleChecker+Unchecked, 13511 mSDsCounter, 818 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10646 IncrementalHoareTripleChecker+Invalid, 13296 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 818 mSolverCounterUnsat, 1976 mSDtfsCounter, 10646 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3499 GetRequests, 2818 SyntacticMatches, 59 SemanticMatches, 622 ConstructedPredicates, 20 IntricatePredicates, 1 DeprecatedPredicates, 4531 ImplicationChecksByTransitivity, 178.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=336occurred in iteration=20, InterpolantAutomatonStates: 393, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 294 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 105.3s InterpolantComputationTime, 4298 NumberOfCodeBlocks, 4227 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 4808 ConstructedInterpolants, 537 QuantifiedInterpolants, 54785 SizeOfPredicates, 123 NumberOfNonLiveVariables, 8366 ConjunctsInSsa, 768 ConjunctsInUnsatCore, 55 InterpolantComputations, 20 PerfectInterpolantSequences, 2805/3289 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-13 13:24:56,298 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f80ccf6-b9d6-4ce9-b327-e5bd7da76bd4/bin/uautomizer-verify-qhAvR1uOyd/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