./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_front_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_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/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_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness_negated.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/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_f9aa9c99-ae35-4807-a366-f71e42401395/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 99fc5ed4adc13b7c0d2c2f3c2054604e6222b21165bf21f460d9833f96bf614d --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:44:32,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:44:32,142 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-13 14:44:32,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:44:32,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:44:32,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:44:32,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:44:32,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:44:32,173 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:44:32,173 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:44:32,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:44:32,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:44:32,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:44:32,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:44:32,174 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:44:32,174 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:44:32,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:44:32,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:44:32,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:44:32,175 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:44:32,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:44:32,175 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:44:32,176 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:44:32,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:44:32,176 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:44:32,176 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:44:32,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:44:32,176 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:44:32,176 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:44:32,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:44:32,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:44:32,177 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:44:32,177 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:44:32,177 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:44:32,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:44:32,177 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:44:32,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:44:32,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:44:32,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:44:32,178 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_f9aa9c99-ae35-4807-a366-f71e42401395/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 -> 99fc5ed4adc13b7c0d2c2f3c2054604e6222b21165bf21f460d9833f96bf614d [2024-11-13 14:44:32,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:44:32,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:44:32,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:44:32,494 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:44:32,495 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:44:32,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness_negated.i Unable to find full path for "g++" [2024-11-13 14:44:34,420 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:44:35,003 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:44:35,004 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness_negated.i [2024-11-13 14:44:35,043 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/data/0fb9bac08/c026b578bb7c41a6b28434c84dd8fec2/FLAG186d389a3 [2024-11-13 14:44:35,064 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/data/0fb9bac08/c026b578bb7c41a6b28434c84dd8fec2 [2024-11-13 14:44:35,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:44:35,068 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:44:35,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:44:35,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:44:35,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:44:35,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:44:35" (1/1) ... [2024-11-13 14:44:35,077 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c5a5552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:44:35, skipping insertion in model container [2024-11-13 14:44:35,077 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:44:35" (1/1) ... [2024-11-13 14:44:35,147 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:44:35,379 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_f9aa9c99-ae35-4807-a366-f71e42401395/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness_negated.i[4495,4508] [2024-11-13 14:44:35,385 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_f9aa9c99-ae35-4807-a366-f71e42401395/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness_negated.i[4555,4568] [2024-11-13 14:44:36,214 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:44:36,215 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:44:36,215 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:44:36,216 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:44:36,217 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:44:36,245 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:44:36,245 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:44:36,248 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:44:36,248 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:44:36,254 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:44:36,256 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:44:36,258 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:44:36,259 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:44:36,865 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_f9aa9c99-ae35-4807-a366-f71e42401395/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness_negated.i[150880,150893] [2024-11-13 14:44:36,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:44:36,900 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:44:36,919 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_f9aa9c99-ae35-4807-a366-f71e42401395/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness_negated.i[4495,4508] [2024-11-13 14:44:36,920 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_f9aa9c99-ae35-4807-a366-f71e42401395/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness_negated.i[4555,4568] [2024-11-13 14:44:37,051 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:44:37,052 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:44:37,052 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:44:37,052 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:44:37,054 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:44:37,070 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:44:37,070 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:44:37,071 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:44:37,072 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:44:37,074 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:44:37,075 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:44:37,076 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:44:37,076 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-13 14:44:37,185 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_f9aa9c99-ae35-4807-a366-f71e42401395/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness_negated.i[150880,150893] [2024-11-13 14:44:37,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:44:37,387 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:44:37,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:44:37 WrapperNode [2024-11-13 14:44:37,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:44:37,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:44:37,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:44:37,389 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:44:37,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:44:37" (1/1) ... [2024-11-13 14:44:37,464 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:44:37" (1/1) ... [2024-11-13 14:44:37,493 INFO L138 Inliner]: procedures = 668, calls = 1043, calls flagged for inlining = 51, calls inlined = 5, statements flattened = 133 [2024-11-13 14:44:37,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:44:37,494 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:44:37,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:44:37,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:44:37,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:44:37" (1/1) ... [2024-11-13 14:44:37,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:44:37" (1/1) ... [2024-11-13 14:44:37,508 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:44:37" (1/1) ... [2024-11-13 14:44:37,545 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 5, 20]. 74 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 14:44:37,545 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:44:37" (1/1) ... [2024-11-13 14:44:37,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:44:37" (1/1) ... [2024-11-13 14:44:37,560 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:44:37" (1/1) ... [2024-11-13 14:44:37,564 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:44:37" (1/1) ... [2024-11-13 14:44:37,568 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:44:37" (1/1) ... [2024-11-13 14:44:37,570 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:44:37" (1/1) ... [2024-11-13 14:44:37,574 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:44:37,575 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:44:37,575 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:44:37,575 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:44:37,576 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:44:37" (1/1) ... [2024-11-13 14:44:37,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:44:37,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:44:37,622 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:44:37,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:44:37,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 14:44:37,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-13 14:44:37,654 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-13 14:44:37,654 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-13 14:44:37,655 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-13 14:44:37,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 14:44:37,655 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-13 14:44:37,655 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-13 14:44:37,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:44:37,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 14:44:37,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 14:44:37,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 14:44:37,655 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_front [2024-11-13 14:44:37,655 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_front [2024-11-13 14:44:37,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:44:37,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:44:37,655 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2024-11-13 14:44:37,655 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2024-11-13 14:44:37,656 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:44:37,656 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:44:37,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 14:44:37,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 14:44:37,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 14:44:37,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 14:44:37,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 14:44:37,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 14:44:37,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 14:44:37,657 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-13 14:44:37,657 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-13 14:44:37,657 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2024-11-13 14:44:37,657 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2024-11-13 14:44:37,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:44:37,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 14:44:37,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 14:44:37,936 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:44:37,940 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:44:38,410 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-11-13 14:44:38,410 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:44:38,427 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:44:38,427 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-13 14:44:38,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:44:38 BoogieIcfgContainer [2024-11-13 14:44:38,428 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:44:38,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:44:38,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:44:38,439 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:44:38,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:44:35" (1/3) ... [2024-11-13 14:44:38,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13130def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:44:38, skipping insertion in model container [2024-11-13 14:44:38,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:44:37" (2/3) ... [2024-11-13 14:44:38,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13130def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:44:38, skipping insertion in model container [2024-11-13 14:44:38,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:44:38" (3/3) ... [2024-11-13 14:44:38,443 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_front_harness_negated.i [2024-11-13 14:44:38,458 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:44:38,462 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_front_harness_negated.i that has 9 procedures, 97 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-13 14:44:38,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:44:38,541 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;@61734698, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:44:38,541 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:44:38,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 64 states have internal predecessors, (82), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 14:44:38,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-13 14:44:38,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:44:38,560 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2024-11-13 14:44:38,560 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:44:38,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:44:38,566 INFO L85 PathProgramCache]: Analyzing trace with hash -264928711, now seen corresponding path program 1 times [2024-11-13 14:44:38,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:44:38,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757453068] [2024-11-13 14:44:38,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:44:38,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:44:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:39,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:44:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:39,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:44:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:39,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:44:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:39,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:44:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:39,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 14:44:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:39,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:44:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:39,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 14:44:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:39,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 14:44:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:39,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:44:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:39,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:44:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:39,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:44:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-13 14:44:39,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:44:39,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757453068] [2024-11-13 14:44:39,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757453068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:44:39,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:44:39,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:44:39,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527126970] [2024-11-13 14:44:39,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:44:39,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:44:39,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:44:39,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:44:39,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:44:39,566 INFO L87 Difference]: Start difference. First operand has 97 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 64 states have internal predecessors, (82), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-13 14:44:39,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:44:39,624 INFO L93 Difference]: Finished difference Result 186 states and 269 transitions. [2024-11-13 14:44:39,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:44:39,627 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 84 [2024-11-13 14:44:39,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:44:39,643 INFO L225 Difference]: With dead ends: 186 [2024-11-13 14:44:39,643 INFO L226 Difference]: Without dead ends: 92 [2024-11-13 14:44:39,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 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 14:44:39,658 INFO L432 NwaCegarLoop]: 126 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, 126 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 14:44:39,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:44:39,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-13 14:44:39,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-13 14:44:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 60 states have internal predecessors, (74), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-13 14:44:39,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 121 transitions. [2024-11-13 14:44:39,760 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 121 transitions. Word has length 84 [2024-11-13 14:44:39,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:44:39,761 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 121 transitions. [2024-11-13 14:44:39,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-13 14:44:39,761 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2024-11-13 14:44:39,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-13 14:44:39,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:44:39,770 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2024-11-13 14:44:39,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:44:39,771 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:44:39,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:44:39,773 INFO L85 PathProgramCache]: Analyzing trace with hash -266030735, now seen corresponding path program 1 times [2024-11-13 14:44:39,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:44:39,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197105590] [2024-11-13 14:44:39,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:44:39,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:44:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:41,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:44:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:41,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:44:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:41,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:44:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:41,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:44:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:41,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 14:44:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:41,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:44:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:41,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 14:44:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:41,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 14:44:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:41,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:44:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:41,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:44:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:41,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:44:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:41,333 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-13 14:44:41,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:44:41,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197105590] [2024-11-13 14:44:41,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197105590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:44:41,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:44:41,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:44:41,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295588461] [2024-11-13 14:44:41,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:44:41,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:44:41,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:44:41,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:44:41,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:44:41,343 INFO L87 Difference]: Start difference. First operand 92 states and 121 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-13 14:44:41,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:44:41,477 INFO L93 Difference]: Finished difference Result 102 states and 133 transitions. [2024-11-13 14:44:41,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:44:41,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 84 [2024-11-13 14:44:41,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:44:41,482 INFO L225 Difference]: With dead ends: 102 [2024-11-13 14:44:41,482 INFO L226 Difference]: Without dead ends: 100 [2024-11-13 14:44:41,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 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 14:44:41,483 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 3 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:44:41,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 581 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:44:41,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-13 14:44:41,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-11-13 14:44:41,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 65 states have internal predecessors, (78), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2024-11-13 14:44:41,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2024-11-13 14:44:41,502 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 130 transitions. Word has length 84 [2024-11-13 14:44:41,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:44:41,503 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 130 transitions. [2024-11-13 14:44:41,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-13 14:44:41,504 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 130 transitions. [2024-11-13 14:44:41,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 14:44:41,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:44:41,510 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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 14:44:41,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:44:41,510 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:44:41,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:44:41,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1574453229, now seen corresponding path program 1 times [2024-11-13 14:44:41,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:44:41,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589525679] [2024-11-13 14:44:41,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:44:41,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:44:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:42,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:44:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:42,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:44:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:42,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:44:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:42,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:44:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:42,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 14:44:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:42,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:44:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:42,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 14:44:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:42,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 14:44:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:42,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:44:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:42,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:44:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:42,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:44:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-13 14:44:43,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:44:43,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589525679] [2024-11-13 14:44:43,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589525679] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:44:43,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494967099] [2024-11-13 14:44:43,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:44:43,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:44:43,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:44:43,164 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:44:43,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:44:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:43,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 14:44:43,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:44:43,733 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-13 14:44:43,733 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:44:43,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494967099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:44:43,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:44:43,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2024-11-13 14:44:43,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802892750] [2024-11-13 14:44:43,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:44:43,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:44:43,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:44:43,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:44:43,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2024-11-13 14:44:43,737 INFO L87 Difference]: Start difference. First operand 99 states and 130 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-13 14:44:44,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:44:44,235 INFO L93 Difference]: Finished difference Result 185 states and 243 transitions. [2024-11-13 14:44:44,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:44:44,236 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 86 [2024-11-13 14:44:44,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:44:44,238 INFO L225 Difference]: With dead ends: 185 [2024-11-13 14:44:44,238 INFO L226 Difference]: Without dead ends: 101 [2024-11-13 14:44:44,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2024-11-13 14:44:44,240 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 130 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:44:44,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 560 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:44:44,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-13 14:44:44,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2024-11-13 14:44:44,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 65 states have internal predecessors, (77), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2024-11-13 14:44:44,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 129 transitions. [2024-11-13 14:44:44,270 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 129 transitions. Word has length 86 [2024-11-13 14:44:44,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:44:44,271 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 129 transitions. [2024-11-13 14:44:44,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-13 14:44:44,272 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 129 transitions. [2024-11-13 14:44:44,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-13 14:44:44,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:44:44,276 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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 14:44:44,298 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:44:44,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:44:44,481 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:44:44,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:44:44,482 INFO L85 PathProgramCache]: Analyzing trace with hash 765958010, now seen corresponding path program 1 times [2024-11-13 14:44:44,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:44:44,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345752953] [2024-11-13 14:44:44,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:44:44,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:44:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:44,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:44:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:44,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:44:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:44,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:44:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:44,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:44:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:45,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 14:44:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:45,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:44:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:45,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 14:44:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:45,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 14:44:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:45,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:44:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:45,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:44:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:45,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:44:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:45,419 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-13 14:44:45,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:44:45,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345752953] [2024-11-13 14:44:45,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345752953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:44:45,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859084161] [2024-11-13 14:44:45,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:44:45,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:44:45,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:44:45,422 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:44:45,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:44:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:45,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 14:44:45,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:44:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-13 14:44:45,876 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:44:45,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859084161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:44:45,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:44:45,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2024-11-13 14:44:45,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135653611] [2024-11-13 14:44:45,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:44:45,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 14:44:45,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:44:45,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 14:44:45,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2024-11-13 14:44:45,881 INFO L87 Difference]: Start difference. First operand 99 states and 129 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-13 14:44:46,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:44:46,403 INFO L93 Difference]: Finished difference Result 191 states and 251 transitions. [2024-11-13 14:44:46,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 14:44:46,404 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 88 [2024-11-13 14:44:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:44:46,406 INFO L225 Difference]: With dead ends: 191 [2024-11-13 14:44:46,409 INFO L226 Difference]: Without dead ends: 106 [2024-11-13 14:44:46,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2024-11-13 14:44:46,410 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 144 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:44:46,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 623 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:44:46,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-13 14:44:46,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2024-11-13 14:44:46,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 64 states have (on average 1.21875) internal successors, (78), 66 states have internal predecessors, (78), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2024-11-13 14:44:46,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 130 transitions. [2024-11-13 14:44:46,436 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 130 transitions. Word has length 88 [2024-11-13 14:44:46,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:44:46,438 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 130 transitions. [2024-11-13 14:44:46,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-13 14:44:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions. [2024-11-13 14:44:46,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-13 14:44:46,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:44:46,440 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1] [2024-11-13 14:44:46,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 14:44:46,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:44:46,644 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:44:46,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:44:46,644 INFO L85 PathProgramCache]: Analyzing trace with hash 726648533, now seen corresponding path program 1 times [2024-11-13 14:44:46,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:44:46,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974591643] [2024-11-13 14:44:46,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:44:46,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:44:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:46,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:44:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:46,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:44:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:46,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:44:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:46,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:44:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:46,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 14:44:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:46,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:44:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:46,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 14:44:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:46,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 14:44:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:46,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:44:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:46,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:44:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:46,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:44:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:47,054 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-13 14:44:47,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:44:47,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974591643] [2024-11-13 14:44:47,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974591643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:44:47,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:44:47,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:44:47,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785630936] [2024-11-13 14:44:47,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:44:47,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:44:47,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:44:47,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:44:47,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:44:47,060 INFO L87 Difference]: Start difference. First operand 100 states and 130 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-13 14:44:47,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:44:47,142 INFO L93 Difference]: Finished difference Result 186 states and 246 transitions. [2024-11-13 14:44:47,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:44:47,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 89 [2024-11-13 14:44:47,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:44:47,144 INFO L225 Difference]: With dead ends: 186 [2024-11-13 14:44:47,144 INFO L226 Difference]: Without dead ends: 104 [2024-11-13 14:44:47,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:44:47,146 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 18 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:44:47,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 508 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:44:47,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-13 14:44:47,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2024-11-13 14:44:47,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 67 states have internal predecessors, (79), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2024-11-13 14:44:47,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 131 transitions. [2024-11-13 14:44:47,159 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 131 transitions. Word has length 89 [2024-11-13 14:44:47,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:44:47,159 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 131 transitions. [2024-11-13 14:44:47,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-13 14:44:47,160 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 131 transitions. [2024-11-13 14:44:47,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 14:44:47,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:44:47,161 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:44:47,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:44:47,162 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:44:47,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:44:47,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1620611945, now seen corresponding path program 1 times [2024-11-13 14:44:47,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:44:47,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091666876] [2024-11-13 14:44:47,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:44:47,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:44:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:47,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:44:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:47,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:44:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:47,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:44:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:47,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:44:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:47,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 14:44:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:47,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:44:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:47,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 14:44:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:47,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 14:44:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:47,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:44:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:47,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:44:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:47,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:44:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:47,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:44:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-13 14:44:47,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:44:47,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091666876] [2024-11-13 14:44:47,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091666876] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:44:47,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739040748] [2024-11-13 14:44:47,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:44:47,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:44:47,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:44:47,728 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:44:47,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 14:44:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:47,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 14:44:47,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:44:48,299 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-13 14:44:48,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:44:48,666 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-13 14:44:48,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739040748] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:44:48,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:44:48,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 14] total 21 [2024-11-13 14:44:48,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170106490] [2024-11-13 14:44:48,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:44:48,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:44:48,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:44:48,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:44:48,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2024-11-13 14:44:48,670 INFO L87 Difference]: Start difference. First operand 101 states and 131 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:44:48,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:44:48,754 INFO L93 Difference]: Finished difference Result 112 states and 144 transitions. [2024-11-13 14:44:48,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:44:48,755 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 97 [2024-11-13 14:44:48,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:44:48,756 INFO L225 Difference]: With dead ends: 112 [2024-11-13 14:44:48,756 INFO L226 Difference]: Without dead ends: 110 [2024-11-13 14:44:48,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2024-11-13 14:44:48,757 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 3 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 685 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 14:44:48,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 685 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:44:48,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-13 14:44:48,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2024-11-13 14:44:48,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 68 states have internal predecessors, (80), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2024-11-13 14:44:48,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 132 transitions. [2024-11-13 14:44:48,797 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 132 transitions. Word has length 97 [2024-11-13 14:44:48,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:44:48,798 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 132 transitions. [2024-11-13 14:44:48,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:44:48,799 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 132 transitions. [2024-11-13 14:44:48,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 14:44:48,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:44:48,802 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:44:48,823 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 14:44:49,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:44:49,007 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:44:49,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:44:49,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1209942436, now seen corresponding path program 1 times [2024-11-13 14:44:49,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:44:49,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048173722] [2024-11-13 14:44:49,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:44:49,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:44:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:49,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:44:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:49,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:44:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:49,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:44:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:49,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:44:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:49,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 14:44:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:49,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:44:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:49,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 14:44:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:49,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 14:44:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:49,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:44:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:49,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:44:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:49,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:44:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:50,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:44:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:50,109 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-13 14:44:50,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:44:50,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048173722] [2024-11-13 14:44:50,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048173722] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:44:50,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329464708] [2024-11-13 14:44:50,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:44:50,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:44:50,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:44:50,112 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:44:50,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 14:44:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:50,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 14:44:50,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:44:50,613 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-13 14:44:50,613 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:44:50,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329464708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:44:50,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:44:50,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2024-11-13 14:44:50,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85155144] [2024-11-13 14:44:50,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:44:50,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 14:44:50,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:44:50,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 14:44:50,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2024-11-13 14:44:50,618 INFO L87 Difference]: Start difference. First operand 102 states and 132 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-13 14:44:50,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:44:50,752 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2024-11-13 14:44:50,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 14:44:50,753 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2024-11-13 14:44:50,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:44:50,756 INFO L225 Difference]: With dead ends: 114 [2024-11-13 14:44:50,757 INFO L226 Difference]: Without dead ends: 112 [2024-11-13 14:44:50,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2024-11-13 14:44:50,759 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:44:50,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 889 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:44:50,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-13 14:44:50,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103. [2024-11-13 14:44:50,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 67 states have (on average 1.208955223880597) internal successors, (81), 69 states have internal predecessors, (81), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2024-11-13 14:44:50,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 133 transitions. [2024-11-13 14:44:50,788 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 133 transitions. Word has length 99 [2024-11-13 14:44:50,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:44:50,788 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 133 transitions. [2024-11-13 14:44:50,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-13 14:44:50,789 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2024-11-13 14:44:50,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 14:44:50,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:44:50,792 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:44:50,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-13 14:44:50,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-13 14:44:50,993 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:44:50,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:44:50,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1605263851, now seen corresponding path program 1 times [2024-11-13 14:44:50,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:44:50,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751055291] [2024-11-13 14:44:50,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:44:50,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:44:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:52,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:44:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:52,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:44:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:52,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:44:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:52,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:44:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:52,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 14:44:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:52,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:44:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:52,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 14:44:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:52,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-13 14:44:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:52,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:44:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:52,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:44:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:52,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:44:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:53,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:44:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:53,198 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-13 14:44:53,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:44:53,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751055291] [2024-11-13 14:44:53,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751055291] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:44:53,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456763306] [2024-11-13 14:44:53,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:44:53,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:44:53,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:44:53,201 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:44:53,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 14:44:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:53,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-13 14:44:53,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:44:53,703 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 22 treesize of output 7 [2024-11-13 14:44:53,714 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 14:44:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 14:44:56,444 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:45:10,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 174 [2024-11-13 14:45:10,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:45:10,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:45:10,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2024-11-13 14:45:10,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-13 14:45:10,118 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-13 14:45:10,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-11-13 14:45:10,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-13 14:45:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-13 14:45:10,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456763306] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:45:10,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:45:10,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [16, 17] total 45 [2024-11-13 14:45:10,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976600368] [2024-11-13 14:45:10,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:45:10,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 14:45:10,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:45:10,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 14:45:10,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1842, Unknown=3, NotChecked=0, Total=1980 [2024-11-13 14:45:10,337 INFO L87 Difference]: Start difference. First operand 103 states and 133 transitions. Second operand has 18 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 13 states have internal predecessors, (55), 8 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-13 14:45:11,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:45:11,012 INFO L93 Difference]: Finished difference Result 188 states and 248 transitions. [2024-11-13 14:45:11,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 14:45:11,013 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 13 states have internal predecessors, (55), 8 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) Word has length 100 [2024-11-13 14:45:11,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:45:11,016 INFO L225 Difference]: With dead ends: 188 [2024-11-13 14:45:11,018 INFO L226 Difference]: Without dead ends: 104 [2024-11-13 14:45:11,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 186 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=145, Invalid=2014, Unknown=3, NotChecked=0, Total=2162 [2024-11-13 14:45:11,020 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 5 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:45:11,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1304 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 14:45:11,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-13 14:45:11,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-13 14:45:11,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 70 states have internal predecessors, (82), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2024-11-13 14:45:11,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 134 transitions. [2024-11-13 14:45:11,043 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 134 transitions. Word has length 100 [2024-11-13 14:45:11,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:45:11,044 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 134 transitions. [2024-11-13 14:45:11,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 13 states have internal predecessors, (55), 8 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-13 14:45:11,044 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 134 transitions. [2024-11-13 14:45:11,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 14:45:11,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:45:11,045 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:45:11,070 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 14:45:11,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:45:11,246 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:45:11,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:45:11,246 INFO L85 PathProgramCache]: Analyzing trace with hash 142248290, now seen corresponding path program 1 times [2024-11-13 14:45:11,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:45:11,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162325430] [2024-11-13 14:45:11,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:45:11,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:45:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:11,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:45:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:11,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:45:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:11,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:45:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:11,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:45:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:11,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:45:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:11,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:45:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:11,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:45:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:11,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:45:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:11,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:45:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:11,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-13 14:45:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:11,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-13 14:45:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:11,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:45:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:11,752 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-13 14:45:11,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:45:11,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162325430] [2024-11-13 14:45:11,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162325430] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:45:11,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488338230] [2024-11-13 14:45:11,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:45:11,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:45:11,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:45:11,756 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:45:11,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 14:45:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:12,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-13 14:45:12,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:45:12,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:45:12,200 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-13 14:45:12,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 14:45:12,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:45:12,226 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 13 treesize of output 1 [2024-11-13 14:45:12,321 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| Int) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|))) (let ((.cse1 (select .cse0 24))) (and (= .cse0 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27| v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|) 24 .cse1)) (<= .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11|) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| 2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|))))) is different from true [2024-11-13 14:45:12,587 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| Int) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|))) (let ((.cse1 (select .cse0 24))) (and (= .cse0 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28| v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|) 24 .cse1)) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| 2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|) (<= .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11|))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27| Int) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|))) (let ((.cse2 (select .cse3 24))) (and (<= .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12|) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27| v_DerPreprocessor_3) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12| v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|) 24 .cse2)) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12| 2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|)))))) is different from true [2024-11-13 14:45:13,432 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30|))) (let ((.cse1 (select .cse0 24))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30|) (= .cse0 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30| v_DerPreprocessor_7) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| v_DerPreprocessor_8) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30|) 24 .cse1)) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| 2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30|) (<= .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14|))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_21 Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_13| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_21))) (let ((.cse2 (select .cse3 24))) (and (<= .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_13|) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_21) (= (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_21 v_DerPreprocessor_5) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_13| v_DerPreprocessor_6) v_aws_linked_list_front_~list.base_BEFORE_CALL_21) 24 .cse2) .cse3) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_13| 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_21))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| Int) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|))) (let ((.cse5 (select .cse4 24))) (and (= .cse4 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28| v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|) 24 .cse5)) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| 2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|) (<= .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11|))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27| Int) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|))) (let ((.cse6 (select .cse7 24))) (and (<= .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12|) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27| v_DerPreprocessor_3) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12| v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|) 24 .cse6)) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12| 2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|)))))) is different from true [2024-11-13 14:45:14,305 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_aws_linked_list_front_~list.base_BEFORE_CALL_22 Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_13| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_22))) (let ((.cse0 (select .cse1 24))) (and (<= .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_13|) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_22 v_DerPreprocessor_5) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_13| v_DerPreprocessor_6) v_aws_linked_list_front_~list.base_BEFORE_CALL_22) 24 .cse0)) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_13| 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_22) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_22))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30|))) (let ((.cse3 (select .cse2 24))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30|) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30| v_DerPreprocessor_7) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| v_DerPreprocessor_8) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30|) 24 .cse3)) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| 2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30|) (<= .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| Int) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|))) (let ((.cse5 (select .cse4 24))) (and (= .cse4 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28| v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|) 24 .cse5)) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| 2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|) (<= .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11|))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_aws_linked_list_front_~list.base_BEFORE_CALL_21 Int) (v_DerPreprocessor_9 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| Int)) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_21))) (let ((.cse6 (select .cse7 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_21 v_DerPreprocessor_9) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| v_DerPreprocessor_10) v_aws_linked_list_front_~list.base_BEFORE_CALL_21) 24 .cse6) .cse7) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_21) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_21) (<= .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15|))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27| Int) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|))) (let ((.cse8 (select .cse9 24))) (and (<= .cse8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12|) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|) (= .cse9 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27| v_DerPreprocessor_3) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12| v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|) 24 .cse8)) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12| 2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|)))))) is different from true [2024-11-13 14:45:15,078 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_22 Int) (v_DerPreprocessor_11 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| Int) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_22))) (let ((.cse0 (select .cse1 24))) (and (<= .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|) (= (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_22 v_DerPreprocessor_11) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_DerPreprocessor_12) v_aws_linked_list_front_~list.base_BEFORE_CALL_22) 24 .cse0) .cse1) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_22) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_22))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_23 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_17| Int) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_23))) (let ((.cse2 (select .cse3 24))) (and (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_23) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_17| 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_23) (<= .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_17|) (= (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_23 v_DerPreprocessor_13) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_17| v_DerPreprocessor_14) v_aws_linked_list_front_~list.base_BEFORE_CALL_23) 24 .cse2) .cse3))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30|))) (let ((.cse5 (select .cse4 24))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30|) (= .cse4 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30| v_DerPreprocessor_7) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| v_DerPreprocessor_8) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30|) 24 .cse5)) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| 2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30|) (<= .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14|))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_aws_linked_list_front_~list.base_BEFORE_CALL_24 Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_13| Int)) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_24))) (let ((.cse6 (select .cse7 24))) (and (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_24) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_13| 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_24) (<= .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_13|) (= (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_24 v_DerPreprocessor_5) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_13| v_DerPreprocessor_6) v_aws_linked_list_front_~list.base_BEFORE_CALL_24) 24 .cse6) .cse7))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| Int) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28| Int)) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|))) (let ((.cse9 (select .cse8 24))) (and (= .cse8 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28| v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|) 24 .cse9)) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| 2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|) (<= .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11|))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_aws_linked_list_front_~list.base_BEFORE_CALL_21 Int) (v_DerPreprocessor_9 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_21))) (let ((.cse10 (select .cse11 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_21 v_DerPreprocessor_9) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| v_DerPreprocessor_10) v_aws_linked_list_front_~list.base_BEFORE_CALL_21) 24 .cse10) .cse11) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_21) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_21) (<= .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15|))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27| Int) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|))) (let ((.cse12 (select .cse13 24))) (and (<= .cse12 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12|) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|) (= .cse13 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27| v_DerPreprocessor_3) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12| v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|) 24 .cse12)) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12| 2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|)))))) is different from true [2024-11-13 14:45:15,963 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_22 Int) (v_DerPreprocessor_11 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| Int) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_22))) (let ((.cse0 (select .cse1 24))) (and (<= .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|) (= (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_22 v_DerPreprocessor_11) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_DerPreprocessor_12) v_aws_linked_list_front_~list.base_BEFORE_CALL_22) 24 .cse0) .cse1) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_22) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_22))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_23 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_17| Int) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_23))) (let ((.cse2 (select .cse3 24))) (and (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_23) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_17| 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_23) (<= .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_17|) (= (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_23 v_DerPreprocessor_13) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_17| v_DerPreprocessor_14) v_aws_linked_list_front_~list.base_BEFORE_CALL_23) 24 .cse2) .cse3))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30|))) (let ((.cse5 (select .cse4 24))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30|) (= .cse4 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30| v_DerPreprocessor_7) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| v_DerPreprocessor_8) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30|) 24 .cse5)) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| 2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30|) (<= .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14|))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_aws_linked_list_front_~list.base_BEFORE_CALL_24 Int) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_13| Int)) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_24))) (let ((.cse6 (select .cse7 24))) (and (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_24) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_13| 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_24) (<= .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_13|) (= (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_24 v_DerPreprocessor_5) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_13| v_DerPreprocessor_6) v_aws_linked_list_front_~list.base_BEFORE_CALL_24) 24 .cse6) .cse7))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| Int) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28| Int)) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|))) (let ((.cse9 (select .cse8 24))) (and (= .cse8 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28| v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|) 24 .cse9)) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| 2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|) (<= .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11|))))) (not (= (mod |c_assume_abort_if_not_#in~cond| 256) 0)) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_aws_linked_list_front_~list.base_BEFORE_CALL_21 Int) (v_DerPreprocessor_9 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_21))) (let ((.cse10 (select .cse11 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_21 v_DerPreprocessor_9) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| v_DerPreprocessor_10) v_aws_linked_list_front_~list.base_BEFORE_CALL_21) 24 .cse10) .cse11) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_21) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_21) (<= .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15|))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27| Int) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|))) (let ((.cse12 (select .cse13 24))) (and (<= .cse12 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12|) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|) (= .cse13 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27| v_DerPreprocessor_3) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12| v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|) 24 .cse12)) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12| 2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|)))))) is different from true [2024-11-13 14:45:17,080 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_24 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_24))) (let ((.cse0 (select .cse1 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_24 v_DerPreprocessor_15) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_DerPreprocessor_16) v_aws_linked_list_front_~list.base_BEFORE_CALL_24) 24 .cse0) .cse1) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_24) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_24) (<= .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_22 Int) (v_DerPreprocessor_11 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| Int) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_22))) (let ((.cse2 (select .cse3 24))) (and (<= .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|) (= (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_22 v_DerPreprocessor_11) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_DerPreprocessor_12) v_aws_linked_list_front_~list.base_BEFORE_CALL_22) 24 .cse2) .cse3) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_22) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_22))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_26 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_26))) (let ((.cse4 (select .cse5 24))) (and (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19| 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_26) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_26) (= (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_26 v_DerPreprocessor_17) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19| v_DerPreprocessor_18) v_aws_linked_list_front_~list.base_BEFORE_CALL_26) 24 .cse4) .cse5) (<= .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19|))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_23 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_17| Int) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_23))) (let ((.cse6 (select .cse7 24))) (and (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_23) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_17| 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_23) (<= .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_17|) (= (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_23 v_DerPreprocessor_13) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_17| v_DerPreprocessor_14) v_aws_linked_list_front_~list.base_BEFORE_CALL_23) 24 .cse6) .cse7))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_27 Int) (v_DerPreprocessor_20 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int) (v_DerPreprocessor_19 (Array Int Int))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_27))) (let ((.cse9 (select .cse8 24))) (and (= .cse8 (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_27 v_DerPreprocessor_19) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_DerPreprocessor_20) v_aws_linked_list_front_~list.base_BEFORE_CALL_27) 24 .cse9)) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_27) (<= .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_27))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_25 Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_13| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_25))) (let ((.cse11 (select .cse10 24))) (and (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_13| 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_25) (= .cse10 (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_25 v_DerPreprocessor_5) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_13| v_DerPreprocessor_6) v_aws_linked_list_front_~list.base_BEFORE_CALL_25) 24 .cse11)) (<= .cse11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_13|) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_25))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| Int)) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30|))) (let ((.cse13 (select .cse12 24))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30|) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30| v_DerPreprocessor_7) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| v_DerPreprocessor_8) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30|) 24 .cse13)) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| 2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30|) (<= .cse13 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| Int) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|))) (let ((.cse15 (select .cse14 24))) (and (= .cse14 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28| v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|) 24 .cse15)) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| 2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|) (<= .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11|))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_aws_linked_list_front_~list.base_BEFORE_CALL_21 Int) (v_DerPreprocessor_9 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| Int)) (let ((.cse17 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_21))) (let ((.cse16 (select .cse17 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_21 v_DerPreprocessor_9) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| v_DerPreprocessor_10) v_aws_linked_list_front_~list.base_BEFORE_CALL_21) 24 .cse16) .cse17) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_21) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_21) (<= .cse16 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15|))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27| Int) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse19 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|))) (let ((.cse18 (select .cse19 24))) (and (<= .cse18 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12|) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|) (= .cse19 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27| v_DerPreprocessor_3) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12| v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|) 24 .cse18)) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12| 2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|)))))) is different from true [2024-11-13 14:45:18,447 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_24 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_24))) (let ((.cse0 (select .cse1 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_24 v_DerPreprocessor_15) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_DerPreprocessor_16) v_aws_linked_list_front_~list.base_BEFORE_CALL_24) 24 .cse0) .cse1) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_24) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_24) (<= .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_21| Int) (v_aws_linked_list_front_~list.base_BEFORE_CALL_28 Int) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_28))) (let ((.cse3 (select .cse2 24))) (and (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_28) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_21| 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_28) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_28 v_DerPreprocessor_22) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_21| v_DerPreprocessor_21) v_aws_linked_list_front_~list.base_BEFORE_CALL_28) 24 .cse3)) (<= .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_21|))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_22 Int) (v_DerPreprocessor_11 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| Int) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_22))) (let ((.cse4 (select .cse5 24))) (and (<= .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|) (= (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_22 v_DerPreprocessor_11) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_DerPreprocessor_12) v_aws_linked_list_front_~list.base_BEFORE_CALL_22) 24 .cse4) .cse5) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_22) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_22))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_26 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_26))) (let ((.cse6 (select .cse7 24))) (and (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19| 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_26) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_26) (= (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_26 v_DerPreprocessor_17) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19| v_DerPreprocessor_18) v_aws_linked_list_front_~list.base_BEFORE_CALL_26) 24 .cse6) .cse7) (<= .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_19|))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_23 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_17| Int) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_23))) (let ((.cse8 (select .cse9 24))) (and (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_23) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_17| 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_23) (<= .cse8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_17|) (= (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_23 v_DerPreprocessor_13) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_17| v_DerPreprocessor_14) v_aws_linked_list_front_~list.base_BEFORE_CALL_23) 24 .cse8) .cse9))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_27 Int) (v_DerPreprocessor_20 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int) (v_DerPreprocessor_19 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_27))) (let ((.cse11 (select .cse10 24))) (and (= .cse10 (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_27 v_DerPreprocessor_19) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_DerPreprocessor_20) v_aws_linked_list_front_~list.base_BEFORE_CALL_27) 24 .cse11)) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_27) (<= .cse11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_27))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_25 Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_13| Int)) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_25))) (let ((.cse13 (select .cse12 24))) (and (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_13| 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_25) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_25 v_DerPreprocessor_5) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_13| v_DerPreprocessor_6) v_aws_linked_list_front_~list.base_BEFORE_CALL_25) 24 .cse13)) (<= .cse13 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_13|) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_25))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30|))) (let ((.cse15 (select .cse14 24))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30|) (= .cse14 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30| v_DerPreprocessor_7) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| v_DerPreprocessor_8) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30|) 24 .cse15)) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| 2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_30|) (<= .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| Int) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28| Int)) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|))) (let ((.cse17 (select .cse16 24))) (and (= .cse16 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28| v_DerPreprocessor_1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|) 24 .cse17)) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| 2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_28|) (<= .cse17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11|))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_aws_linked_list_front_~list.base_BEFORE_CALL_21 Int) (v_DerPreprocessor_9 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_21))) (let ((.cse18 (select .cse19 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_21 v_DerPreprocessor_9) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| v_DerPreprocessor_10) v_aws_linked_list_front_~list.base_BEFORE_CALL_21) 24 .cse18) .cse19) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_21) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_21) (<= .cse18 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15|))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27| Int) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse21 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|))) (let ((.cse20 (select .cse21 24))) (and (<= .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12|) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|) (= .cse21 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27| v_DerPreprocessor_3) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12| v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|) 24 .cse20)) (<= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_12| 2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_27|)))))) is different from true [2024-11-13 14:45:28,157 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 75 not checked. [2024-11-13 14:45:28,158 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:45:29,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488338230] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:45:29,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:45:29,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 34] total 39 [2024-11-13 14:45:29,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837793014] [2024-11-13 14:45:29,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:45:29,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-13 14:45:29,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:45:29,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-13 14:45:29,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1092, Unknown=29, NotChecked=584, Total=1806 [2024-11-13 14:45:29,043 INFO L87 Difference]: Start difference. First operand 104 states and 134 transitions. Second operand has 39 states, 33 states have (on average 3.727272727272727) internal successors, (123), 32 states have internal predecessors, (123), 15 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (23), 13 states have call predecessors, (23), 14 states have call successors, (23) [2024-11-13 14:45:36,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:45:36,491 INFO L93 Difference]: Finished difference Result 220 states and 279 transitions. [2024-11-13 14:45:36,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 14:45:36,492 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 33 states have (on average 3.727272727272727) internal successors, (123), 32 states have internal predecessors, (123), 15 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (23), 13 states have call predecessors, (23), 14 states have call successors, (23) Word has length 101 [2024-11-13 14:45:36,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:45:36,493 INFO L225 Difference]: With dead ends: 220 [2024-11-13 14:45:36,493 INFO L226 Difference]: Without dead ends: 128 [2024-11-13 14:45:36,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=227, Invalid=2858, Unknown=139, NotChecked=936, Total=4160 [2024-11-13 14:45:36,495 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 118 mSDsluCounter, 2146 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 12 mSolverCounterUnsat, 49 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 2251 SdHoareTripleChecker+Invalid, 2233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 49 IncrementalHoareTripleChecker+Unknown, 1228 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:45:36,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 2251 Invalid, 2233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 944 Invalid, 49 Unknown, 1228 Unchecked, 4.0s Time] [2024-11-13 14:45:36,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-13 14:45:36,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-13 14:45:36,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 87 states have (on average 1.206896551724138) internal successors, (105), 89 states have internal predecessors, (105), 26 states have call successors, (26), 13 states have call predecessors, (26), 14 states have return successors, (30), 25 states have call predecessors, (30), 25 states have call successors, (30) [2024-11-13 14:45:36,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 161 transitions. [2024-11-13 14:45:36,511 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 161 transitions. Word has length 101 [2024-11-13 14:45:36,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:45:36,512 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 161 transitions. [2024-11-13 14:45:36,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 33 states have (on average 3.727272727272727) internal successors, (123), 32 states have internal predecessors, (123), 15 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (23), 13 states have call predecessors, (23), 14 states have call successors, (23) [2024-11-13 14:45:36,512 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 161 transitions. [2024-11-13 14:45:36,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-13 14:45:36,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:45:36,514 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-13 14:45:36,530 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 14:45:36,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:45:36,718 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:45:36,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:45:36,718 INFO L85 PathProgramCache]: Analyzing trace with hash -330570358, now seen corresponding path program 1 times [2024-11-13 14:45:36,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:45:36,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609041962] [2024-11-13 14:45:36,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:45:36,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:45:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:37,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:45:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:37,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:45:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:37,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:45:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:37,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:45:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:37,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:45:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:37,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:45:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:37,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:45:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:37,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:45:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:37,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 14:45:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:37,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:45:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:37,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:45:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:37,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:45:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:37,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:45:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:37,374 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-13 14:45:37,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:45:37,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609041962] [2024-11-13 14:45:37,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609041962] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:45:37,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144896250] [2024-11-13 14:45:37,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:45:37,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:45:37,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:45:37,377 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:45:37,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 14:45:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:37,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 14:45:37,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:45:37,829 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 14:45:37,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:45:38,192 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-13 14:45:38,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144896250] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:45:38,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:45:38,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 19 [2024-11-13 14:45:38,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778224894] [2024-11-13 14:45:38,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:45:38,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 14:45:38,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:45:38,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 14:45:38,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2024-11-13 14:45:38,194 INFO L87 Difference]: Start difference. First operand 128 states and 161 transitions. Second operand has 19 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 8 states have call successors, (25), 3 states have call predecessors, (25), 6 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2024-11-13 14:45:38,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:45:38,630 INFO L93 Difference]: Finished difference Result 224 states and 284 transitions. [2024-11-13 14:45:38,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 14:45:38,631 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 8 states have call successors, (25), 3 states have call predecessors, (25), 6 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) Word has length 114 [2024-11-13 14:45:38,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:45:38,633 INFO L225 Difference]: With dead ends: 224 [2024-11-13 14:45:38,635 INFO L226 Difference]: Without dead ends: 137 [2024-11-13 14:45:38,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2024-11-13 14:45:38,636 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 115 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:45:38,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1312 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:45:38,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-13 14:45:38,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 129. [2024-11-13 14:45:38,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 88 states have (on average 1.2045454545454546) internal successors, (106), 90 states have internal predecessors, (106), 26 states have call successors, (26), 13 states have call predecessors, (26), 14 states have return successors, (30), 25 states have call predecessors, (30), 25 states have call successors, (30) [2024-11-13 14:45:38,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 162 transitions. [2024-11-13 14:45:38,660 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 162 transitions. Word has length 114 [2024-11-13 14:45:38,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:45:38,661 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 162 transitions. [2024-11-13 14:45:38,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 8 states have call successors, (25), 3 states have call predecessors, (25), 6 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2024-11-13 14:45:38,662 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 162 transitions. [2024-11-13 14:45:38,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 14:45:38,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:45:38,664 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-13 14:45:38,684 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 14:45:38,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:45:38,865 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:45:38,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:45:38,865 INFO L85 PathProgramCache]: Analyzing trace with hash -280271593, now seen corresponding path program 1 times [2024-11-13 14:45:38,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:45:38,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76335930] [2024-11-13 14:45:38,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:45:38,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:45:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:39,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:45:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:39,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:45:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:39,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:45:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:39,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:45:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:39,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:45:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:39,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:45:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:39,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:45:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:39,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:45:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:39,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:45:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:39,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:45:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:39,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 14:45:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:39,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:45:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:39,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:45:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:39,556 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-13 14:45:39,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:45:39,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76335930] [2024-11-13 14:45:39,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76335930] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:45:39,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172354696] [2024-11-13 14:45:39,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:45:39,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:45:39,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:45:39,559 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:45:39,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 14:45:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:45:39,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-13 14:45:39,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:45:40,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:45:40,080 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-13 14:45:40,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:45:40,090 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 13 treesize of output 1 [2024-11-13 14:45:40,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:45:40,097 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 40 treesize of output 21 [2024-11-13 14:45:40,100 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 14:45:44,147 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_37| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_37|) (<= (+ 2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_37|) 24)) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_37|))) is different from true [2024-11-13 14:45:48,355 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_38| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_38|) (<= (+ (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_38|) 24) 2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_38|))) is different from true [2024-11-13 14:45:52,505 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_29 Int)) (and (<= (+ (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_29) 24) 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_29) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_29))) is different from true [2024-11-13 14:45:56,688 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_30 Int)) (and (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_30) (<= (+ 2 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_30) 24)) v_aws_linked_list_front_~list.base_BEFORE_CALL_30))) is different from true [2024-11-13 14:46:00,764 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_31 Int)) (and (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_31) (<= (+ (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_31) 24) 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_31))) is different from true [2024-11-13 14:46:04,862 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_32 Int)) (and (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_32) (<= (+ 2 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_32) 24)) v_aws_linked_list_front_~list.base_BEFORE_CALL_32))) is different from true [2024-11-13 14:46:08,975 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_33 Int)) (and (<= (+ 2 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_33) 24)) v_aws_linked_list_front_~list.base_BEFORE_CALL_33) (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_33))) is different from true [2024-11-13 14:46:30,549 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 91 not checked. [2024-11-13 14:46:30,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:46:49,224 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 14:46:49,427 INFO L349 Elim1Store]: treesize reduction 136, result has 57.6 percent of original size [2024-11-13 14:46:49,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 916 treesize of output 809 [2024-11-13 14:46:49,491 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 3858 treesize of output 3706 [2024-11-13 14:46:49,747 INFO L349 Elim1Store]: treesize reduction 8, result has 91.0 percent of original size [2024-11-13 14:46:49,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 1070 treesize of output 1041 [2024-11-13 14:46:49,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:46:49,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 703 treesize of output 719 [2024-11-13 14:46:49,900 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 701 treesize of output 677 [2024-11-13 14:46:49,953 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 878 treesize of output 836 [2024-11-13 14:46:54,755 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 14:46:54,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 14:46:54,816 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-13 14:46:54,816 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 19 treesize of output 11 [2024-11-13 14:46:54,915 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-13 14:46:54,915 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 19 treesize of output 11 [2024-11-13 14:46:55,021 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-13 14:46:55,021 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 19 treesize of output 11 [2024-11-13 14:46:55,033 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 14:46:55,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2024-11-13 14:46:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 14:46:55,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172354696] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:46:55,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:46:55,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 28, 21] total 54 [2024-11-13 14:46:55,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309052248] [2024-11-13 14:46:55,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:46:55,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-13 14:46:55,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:46:55,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-13 14:46:55,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2020, Unknown=15, NotChecked=672, Total=2862 [2024-11-13 14:46:55,417 INFO L87 Difference]: Start difference. First operand 129 states and 162 transitions. Second operand has 54 states, 52 states have (on average 3.4615384615384617) internal successors, (180), 46 states have internal predecessors, (180), 14 states have call successors, (39), 13 states have call predecessors, (39), 15 states have return successors, (35), 15 states have call predecessors, (35), 13 states have call successors, (35) [2024-11-13 14:46:59,469 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 14:47:03,479 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 14:47:07,539 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 14:47:11,551 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 14:47:15,572 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 14:47:19,615 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 14:49:31,506 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 14:49:35,520 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 14:49:39,563 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 14:49:43,594 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 14:49:47,601 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 14:49:51,604 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 14:49:55,705 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 14:49:59,800 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 14:50:19,878 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 14:50:39,981 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 14:50:43,989 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 14:51:04,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:51:24,078 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 14:51:28,081 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 14:51:59,144 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, 1] [2024-11-13 14:52:23,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-13 14:52:27,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-13 14:52:44,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-13 14:52:48,832 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 14:53:22,765 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 14:54:10,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:54:10,704 INFO L93 Difference]: Finished difference Result 293 states and 388 transitions. [2024-11-13 14:54:10,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-13 14:54:10,705 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 3.4615384615384617) internal successors, (180), 46 states have internal predecessors, (180), 14 states have call successors, (39), 13 states have call predecessors, (39), 15 states have return successors, (35), 15 states have call predecessors, (35), 13 states have call successors, (35) Word has length 116 [2024-11-13 14:54:10,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:54:10,709 INFO L225 Difference]: With dead ends: 293 [2024-11-13 14:54:10,709 INFO L226 Difference]: Without dead ends: 201 [2024-11-13 14:54:10,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 211 SyntacticMatches, 20 SemanticMatches, 119 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 3064 ImplicationChecksByTransitivity, 393.0s TimeCoverageRelationStatistics Valid=1026, Invalid=11820, Unknown=64, NotChecked=1610, Total=14520 [2024-11-13 14:54:10,714 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 357 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 3169 mSolverCounterSat, 185 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 109.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1932 SdHoareTripleChecker+Invalid, 4992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 3169 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 1612 IncrementalHoareTripleChecker+Unchecked, 109.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:54:10,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1932 Invalid, 4992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 3169 Invalid, 26 Unknown, 1612 Unchecked, 109.7s Time] [2024-11-13 14:54:10,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-13 14:54:10,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 184. [2024-11-13 14:54:10,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 134 states have (on average 1.2761194029850746) internal successors, (171), 135 states have internal predecessors, (171), 29 states have call successors, (29), 16 states have call predecessors, (29), 20 states have return successors, (41), 32 states have call predecessors, (41), 28 states have call successors, (41) [2024-11-13 14:54:10,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 241 transitions. [2024-11-13 14:54:10,757 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 241 transitions. Word has length 116 [2024-11-13 14:54:10,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:54:10,758 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 241 transitions. [2024-11-13 14:54:10,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 3.4615384615384617) internal successors, (180), 46 states have internal predecessors, (180), 14 states have call successors, (39), 13 states have call predecessors, (39), 15 states have return successors, (35), 15 states have call predecessors, (35), 13 states have call successors, (35) [2024-11-13 14:54:10,758 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 241 transitions. [2024-11-13 14:54:10,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-13 14:54:10,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:54:10,761 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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 14:54:10,780 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 14:54:10,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:54:10,964 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:54:10,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:54:10,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1813879022, now seen corresponding path program 1 times [2024-11-13 14:54:10,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:54:10,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410900335] [2024-11-13 14:54:10,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:54:10,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:54:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:11,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:54:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:11,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:54:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:11,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:54:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:11,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:54:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:11,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:54:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:11,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:54:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:11,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:54:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:11,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 14:54:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:11,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 14:54:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:11,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:54:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:11,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 14:54:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:11,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 14:54:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:11,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 14:54:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:11,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 14:54:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:11,792 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 14:54:11,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:54:11,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410900335] [2024-11-13 14:54:11,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410900335] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:54:11,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210270670] [2024-11-13 14:54:11,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:54:11,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:54:11,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:54:11,796 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:54:11,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 14:54:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:12,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 14:54:12,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:54:12,365 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-13 14:54:12,365 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:54:12,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210270670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:54:12,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:54:12,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2024-11-13 14:54:12,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555150590] [2024-11-13 14:54:12,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:54:12,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:54:12,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:54:12,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:54:12,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:54:12,367 INFO L87 Difference]: Start difference. First operand 184 states and 241 transitions. Second operand has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-13 14:54:12,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:54:12,529 INFO L93 Difference]: Finished difference Result 325 states and 432 transitions. [2024-11-13 14:54:12,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:54:12,530 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 114 [2024-11-13 14:54:12,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:54:12,532 INFO L225 Difference]: With dead ends: 325 [2024-11-13 14:54:12,532 INFO L226 Difference]: Without dead ends: 186 [2024-11-13 14:54:12,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-11-13 14:54:12,534 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:54:12,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 758 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:54:12,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-13 14:54:12,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 181. [2024-11-13 14:54:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 132 states have internal predecessors, (169), 29 states have call successors, (29), 16 states have call predecessors, (29), 19 states have return successors, (38), 32 states have call predecessors, (38), 28 states have call successors, (38) [2024-11-13 14:54:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 236 transitions. [2024-11-13 14:54:12,572 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 236 transitions. Word has length 114 [2024-11-13 14:54:12,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:54:12,573 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 236 transitions. [2024-11-13 14:54:12,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-13 14:54:12,573 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 236 transitions. [2024-11-13 14:54:12,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 14:54:12,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:54:12,575 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:54:12,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 14:54:12,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:54:12,779 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:54:12,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:54:12,779 INFO L85 PathProgramCache]: Analyzing trace with hash -641745979, now seen corresponding path program 1 times [2024-11-13 14:54:12,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:54:12,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413960575] [2024-11-13 14:54:12,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:54:12,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:54:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:13,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:54:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:13,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:54:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:13,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:54:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:13,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:54:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:13,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:54:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:13,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:54:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:14,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:54:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:14,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:54:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:14,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 14:54:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:14,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 14:54:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:14,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:54:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:14,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 14:54:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:14,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 14:54:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:14,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-13 14:54:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:14,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 14:54:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-13 14:54:14,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:54:14,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413960575] [2024-11-13 14:54:14,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413960575] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:54:14,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585492157] [2024-11-13 14:54:14,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:54:14,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:54:14,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:54:14,628 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:54:14,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 14:54:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:15,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-13 14:54:15,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:54:15,058 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 6 treesize of output 5 [2024-11-13 14:54:15,293 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 14:54:15,327 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 14:54:15,463 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:54:15,463 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 11 treesize of output 11 [2024-11-13 14:54:15,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:54:15,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:54:15,492 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 14:54:15,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:54:15,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:54:15,510 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 14:54:15,523 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 34 treesize of output 25 [2024-11-13 14:54:15,552 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 14:54:15,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:54:15,711 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 100 treesize of output 87 [2024-11-13 14:54:15,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:54:15,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:54:15,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:54:15,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 75 [2024-11-13 14:54:15,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 25 [2024-11-13 14:54:18,156 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-13 14:54:18,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:54:18,775 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_front_harness_~#list~0#1.offset|))) (and (forall ((v_ArrVal_950 Int) (v_ArrVal_949 Int)) (= (select (select (let ((.cse0 (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_949)))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_950))) |c_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_948 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_944))) (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_ArrVal_948))) |c_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2024-11-13 14:54:18,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:54:18,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2024-11-13 14:54:19,050 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 14:54:19,052 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 14:54:19,236 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2024-11-13 14:54:19,237 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 173 treesize of output 202 [2024-11-13 14:54:19,259 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 14:54:19,261 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 14:54:19,444 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2024-11-13 14:54:19,444 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 329 treesize of output 316 [2024-11-13 14:54:19,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:54:19,513 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 262 treesize of output 260 [2024-11-13 14:54:19,554 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 219 treesize of output 207 [2024-11-13 14:54:19,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:54:19,608 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 308 treesize of output 306 [2024-11-13 14:54:19,630 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 265 treesize of output 253 [2024-11-13 14:54:20,592 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 14:54:20,716 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 14:54:21,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:54:21,381 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 418 treesize of output 412 [2024-11-13 14:54:22,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:54:22,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 560 treesize of output 510 [2024-11-13 14:54:24,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585492157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:54:24,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:54:24,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2024-11-13 14:54:24,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306516555] [2024-11-13 14:54:24,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:54:24,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 14:54:24,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:54:24,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 14:54:24,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=570, Unknown=2, NotChecked=48, Total=702 [2024-11-13 14:54:24,342 INFO L87 Difference]: Start difference. First operand 181 states and 236 transitions. Second operand has 21 states, 21 states have (on average 5.809523809523809) internal successors, (122), 20 states have internal predecessors, (122), 9 states have call successors, (29), 5 states have call predecessors, (29), 7 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2024-11-13 14:54:27,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:54:27,855 INFO L93 Difference]: Finished difference Result 458 states and 607 transitions. [2024-11-13 14:54:27,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 14:54:27,856 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.809523809523809) internal successors, (122), 20 states have internal predecessors, (122), 9 states have call successors, (29), 5 states have call predecessors, (29), 7 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) Word has length 126 [2024-11-13 14:54:27,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:54:27,859 INFO L225 Difference]: With dead ends: 458 [2024-11-13 14:54:27,859 INFO L226 Difference]: Without dead ends: 368 [2024-11-13 14:54:27,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 247 SyntacticMatches, 15 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=279, Invalid=1885, Unknown=2, NotChecked=90, Total=2256 [2024-11-13 14:54:27,862 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 257 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:54:27,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1275 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-13 14:54:27,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-13 14:54:27,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 339. [2024-11-13 14:54:27,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 246 states have (on average 1.2845528455284554) internal successors, (316), 247 states have internal predecessors, (316), 56 states have call successors, (56), 29 states have call predecessors, (56), 36 states have return successors, (74), 62 states have call predecessors, (74), 54 states have call successors, (74) [2024-11-13 14:54:27,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 446 transitions. [2024-11-13 14:54:27,949 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 446 transitions. Word has length 126 [2024-11-13 14:54:27,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:54:27,950 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 446 transitions. [2024-11-13 14:54:27,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.809523809523809) internal successors, (122), 20 states have internal predecessors, (122), 9 states have call successors, (29), 5 states have call predecessors, (29), 7 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2024-11-13 14:54:27,950 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 446 transitions. [2024-11-13 14:54:27,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 14:54:27,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:54:27,953 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:54:27,980 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-13 14:54:28,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:54:28,154 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:54:28,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:54:28,154 INFO L85 PathProgramCache]: Analyzing trace with hash -422891261, now seen corresponding path program 1 times [2024-11-13 14:54:28,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:54:28,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511873910] [2024-11-13 14:54:28,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:54:28,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:54:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:30,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:54:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:30,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:54:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:30,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:54:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:30,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:54:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:30,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:54:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:30,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:54:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:30,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:54:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:30,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:54:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:30,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 14:54:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:30,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 14:54:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:30,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:54:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:30,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 14:54:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:30,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 14:54:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:30,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-13 14:54:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:30,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 14:54:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:30,957 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-13 14:54:30,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:54:30,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511873910] [2024-11-13 14:54:30,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511873910] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:54:30,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831576358] [2024-11-13 14:54:30,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:54:30,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:54:30,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:54:30,962 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:54:30,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 14:54:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:54:31,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 107 conjuncts are in the unsatisfiable core [2024-11-13 14:54:31,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:54:31,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-13 14:54:31,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 21 [2024-11-13 14:54:31,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 1 [2024-11-13 14:54:31,677 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 21 treesize of output 1 [2024-11-13 14:54:31,687 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 14:54:31,693 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 11 treesize of output 7 [2024-11-13 14:54:31,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:54:31,704 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 18 treesize of output 1 [2024-11-13 14:54:34,733 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-13 14:54:34,733 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2024-11-13 14:54:51,854 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 52 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 14:54:51,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:54:52,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831576358] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:54:52,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:54:52,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 28] total 43 [2024-11-13 14:54:52,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705253514] [2024-11-13 14:54:52,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:54:52,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-13 14:54:52,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:54:52,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-13 14:54:52,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2095, Unknown=3, NotChecked=0, Total=2256 [2024-11-13 14:54:52,892 INFO L87 Difference]: Start difference. First operand 339 states and 446 transitions. Second operand has 43 states, 40 states have (on average 3.575) internal successors, (143), 40 states have internal predecessors, (143), 16 states have call successors, (32), 6 states have call predecessors, (32), 10 states have return successors, (29), 14 states have call predecessors, (29), 16 states have call successors, (29) [2024-11-13 14:54:56,909 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 14:55:00,954 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 14:55:05,194 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 14:55:09,271 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 14:55:13,380 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 14:55:15,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:55:19,693 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 14:55:23,838 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 14:55:27,928 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 14:55:32,262 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 14:55:36,266 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 14:55:51,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:55:51,244 INFO L93 Difference]: Finished difference Result 865 states and 1263 transitions. [2024-11-13 14:55:51,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-11-13 14:55:51,245 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 3.575) internal successors, (143), 40 states have internal predecessors, (143), 16 states have call successors, (32), 6 states have call predecessors, (32), 10 states have return successors, (29), 14 states have call predecessors, (29), 16 states have call successors, (29) Word has length 126 [2024-11-13 14:55:51,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:55:51,249 INFO L225 Difference]: With dead ends: 865 [2024-11-13 14:55:51,249 INFO L226 Difference]: Without dead ends: 441 [2024-11-13 14:55:51,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 174 SyntacticMatches, 7 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2101 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=834, Invalid=8669, Unknown=3, NotChecked=0, Total=9506 [2024-11-13 14:55:51,254 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 610 mSDsluCounter, 2182 mSDsCounter, 0 mSdLazyCounter, 3875 mSolverCounterSat, 414 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 2285 SdHoareTripleChecker+Invalid, 4299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 3875 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:55:51,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 2285 Invalid, 4299 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [414 Valid, 3875 Invalid, 10 Unknown, 0 Unchecked, 52.0s Time] [2024-11-13 14:55:51,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-13 14:55:51,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 343. [2024-11-13 14:55:51,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 250 states have (on average 1.264) internal successors, (316), 253 states have internal predecessors, (316), 56 states have call successors, (56), 29 states have call predecessors, (56), 36 states have return successors, (74), 60 states have call predecessors, (74), 54 states have call successors, (74) [2024-11-13 14:55:51,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 446 transitions. [2024-11-13 14:55:51,405 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 446 transitions. Word has length 126 [2024-11-13 14:55:51,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:55:51,406 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 446 transitions. [2024-11-13 14:55:51,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 3.575) internal successors, (143), 40 states have internal predecessors, (143), 16 states have call successors, (32), 6 states have call predecessors, (32), 10 states have return successors, (29), 14 states have call predecessors, (29), 16 states have call successors, (29) [2024-11-13 14:55:51,407 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 446 transitions. [2024-11-13 14:55:51,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 14:55:51,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:55:51,409 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:55:51,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 14:55:51,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-13 14:55:51,610 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:55:51,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:55:51,611 INFO L85 PathProgramCache]: Analyzing trace with hash -556904767, now seen corresponding path program 1 times [2024-11-13 14:55:51,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:55:51,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15885669] [2024-11-13 14:55:51,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:55:51,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:55:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:55:52,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:55:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:55:52,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:55:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:55:52,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:55:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:55:52,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:55:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:55:52,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:55:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:55:52,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:55:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:55:53,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:55:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:55:53,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:55:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:55:53,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 14:55:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:55:53,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 14:55:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:55:53,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:55:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:55:53,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 14:55:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:55:53,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 14:55:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:55:53,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-13 14:55:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:55:53,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 14:55:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:55:53,506 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-13 14:55:53,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:55:53,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15885669] [2024-11-13 14:55:53,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15885669] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:55:53,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264791876] [2024-11-13 14:55:53,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:55:53,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:55:53,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:55:53,509 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:55:53,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 14:55:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:55:53,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-13 14:55:53,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:55:53,987 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 13 treesize of output 1 [2024-11-13 14:55:53,991 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 13 treesize of output 1 [2024-11-13 14:55:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 47 proven. 5 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-13 14:55:55,445 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:55:56,241 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-13 14:55:56,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264791876] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:55:56,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:55:56,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 26 [2024-11-13 14:55:56,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167786294] [2024-11-13 14:55:56,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:55:56,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-13 14:55:56,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:55:56,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-13 14:55:56,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2024-11-13 14:55:56,244 INFO L87 Difference]: Start difference. First operand 343 states and 446 transitions. Second operand has 26 states, 25 states have (on average 4.96) internal successors, (124), 25 states have internal predecessors, (124), 8 states have call successors, (31), 4 states have call predecessors, (31), 6 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) [2024-11-13 14:56:00,536 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 14:56:04,544 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 14:56:08,981 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 14:56:10,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:56:10,888 INFO L93 Difference]: Finished difference Result 1093 states and 1504 transitions. [2024-11-13 14:56:10,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-13 14:56:10,889 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.96) internal successors, (124), 25 states have internal predecessors, (124), 8 states have call successors, (31), 4 states have call predecessors, (31), 6 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) Word has length 126 [2024-11-13 14:56:10,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:56:10,901 INFO L225 Difference]: With dead ends: 1093 [2024-11-13 14:56:10,901 INFO L226 Difference]: Without dead ends: 862 [2024-11-13 14:56:10,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 260 SyntacticMatches, 10 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=306, Invalid=1674, Unknown=0, NotChecked=0, Total=1980 [2024-11-13 14:56:10,906 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 196 mSDsluCounter, 1860 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 69 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 2026 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:56:10,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 2026 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1055 Invalid, 3 Unknown, 0 Unchecked, 13.6s Time] [2024-11-13 14:56:10,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2024-11-13 14:56:11,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 643. [2024-11-13 14:56:11,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 473 states have (on average 1.285412262156448) internal successors, (608), 479 states have internal predecessors, (608), 103 states have call successors, (103), 47 states have call predecessors, (103), 66 states have return successors, (158), 116 states have call predecessors, (158), 99 states have call successors, (158) [2024-11-13 14:56:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 869 transitions. [2024-11-13 14:56:11,093 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 869 transitions. Word has length 126 [2024-11-13 14:56:11,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:56:11,093 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 869 transitions. [2024-11-13 14:56:11,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.96) internal successors, (124), 25 states have internal predecessors, (124), 8 states have call successors, (31), 4 states have call predecessors, (31), 6 states have return successors, (28), 7 states have call predecessors, (28), 8 states have call successors, (28) [2024-11-13 14:56:11,094 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 869 transitions. [2024-11-13 14:56:11,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 14:56:11,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:56:11,098 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:56:11,126 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 14:56:11,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-13 14:56:11,302 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:56:11,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:56:11,302 INFO L85 PathProgramCache]: Analyzing trace with hash -494865153, now seen corresponding path program 1 times [2024-11-13 14:56:11,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:56:11,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534699996] [2024-11-13 14:56:11,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:56:11,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:56:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:11,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:56:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:11,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:56:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:11,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:56:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:11,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:56:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:11,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:56:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:11,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:56:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:12,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:56:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:12,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:56:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:12,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 14:56:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:12,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 14:56:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:12,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:56:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:12,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 14:56:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:12,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 14:56:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:12,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-13 14:56:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:12,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 14:56:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:12,431 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-13 14:56:12,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:56:12,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534699996] [2024-11-13 14:56:12,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534699996] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:56:12,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210425] [2024-11-13 14:56:12,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:56:12,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:56:12,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:56:12,435 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:56:12,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 14:56:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:12,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-13 14:56:12,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:56:12,973 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 14:56:12,976 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 14:56:17,188 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_11| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_11| Int)) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_11|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_11|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_11| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_11| Int)) (not (= (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_11|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_11|) 0)))) is different from true [2024-11-13 14:56:18,619 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 50 proven. 17 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-13 14:56:18,619 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:56:19,521 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-13 14:56:19,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210425] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:56:19,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:56:19,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 12] total 28 [2024-11-13 14:56:19,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505189091] [2024-11-13 14:56:19,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:56:19,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-13 14:56:19,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:56:19,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-13 14:56:19,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=618, Unknown=1, NotChecked=50, Total=756 [2024-11-13 14:56:19,523 INFO L87 Difference]: Start difference. First operand 643 states and 869 transitions. Second operand has 28 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 27 states have internal predecessors, (128), 12 states have call successors, (31), 5 states have call predecessors, (31), 7 states have return successors, (28), 10 states have call predecessors, (28), 12 states have call successors, (28) [2024-11-13 14:56:23,573 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 14:56:27,620 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 14:56:31,670 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 14:56:36,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:56:36,260 INFO L93 Difference]: Finished difference Result 1805 states and 2522 transitions. [2024-11-13 14:56:36,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-13 14:56:36,261 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 27 states have internal predecessors, (128), 12 states have call successors, (31), 5 states have call predecessors, (31), 7 states have return successors, (28), 10 states have call predecessors, (28), 12 states have call successors, (28) Word has length 126 [2024-11-13 14:56:36,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:56:36,269 INFO L225 Difference]: With dead ends: 1805 [2024-11-13 14:56:36,269 INFO L226 Difference]: Without dead ends: 1117 [2024-11-13 14:56:36,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 258 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=411, Invalid=2784, Unknown=1, NotChecked=110, Total=3306 [2024-11-13 14:56:36,275 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 270 mSDsluCounter, 2044 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 82 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 2192 SdHoareTripleChecker+Invalid, 2455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 513 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:56:36,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 2192 Invalid, 2455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1857 Invalid, 3 Unknown, 513 Unchecked, 14.9s Time] [2024-11-13 14:56:36,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2024-11-13 14:56:36,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 907. [2024-11-13 14:56:36,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 702 states have (on average 1.2706552706552707) internal successors, (892), 715 states have internal predecessors, (892), 126 states have call successors, (126), 56 states have call predecessors, (126), 78 states have return successors, (196), 135 states have call predecessors, (196), 122 states have call successors, (196) [2024-11-13 14:56:36,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1214 transitions. [2024-11-13 14:56:36,580 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1214 transitions. Word has length 126 [2024-11-13 14:56:36,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:56:36,581 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1214 transitions. [2024-11-13 14:56:36,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 27 states have internal predecessors, (128), 12 states have call successors, (31), 5 states have call predecessors, (31), 7 states have return successors, (28), 10 states have call predecessors, (28), 12 states have call successors, (28) [2024-11-13 14:56:36,582 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1214 transitions. [2024-11-13 14:56:36,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 14:56:36,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:56:36,585 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:56:36,608 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 14:56:36,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 14:56:36,786 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:56:36,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:56:36,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1004338243, now seen corresponding path program 1 times [2024-11-13 14:56:36,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:56:36,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296464593] [2024-11-13 14:56:36,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:56:36,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:56:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:37,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:56:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:37,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:56:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:37,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:56:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:37,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:56:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:37,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:56:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:37,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:56:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:37,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:56:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:37,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:56:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:37,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 14:56:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:37,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 14:56:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:37,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:56:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:37,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 14:56:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:37,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 14:56:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:37,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-13 14:56:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:37,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 14:56:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:37,676 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-13 14:56:37,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:56:37,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296464593] [2024-11-13 14:56:37,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296464593] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:56:37,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534012733] [2024-11-13 14:56:37,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:56:37,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:56:37,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:56:37,680 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:56:37,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 14:56:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:38,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:56:38,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:56:38,356 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-13 14:56:38,356 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:56:38,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534012733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:56:38,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:56:38,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-11-13 14:56:38,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770658003] [2024-11-13 14:56:38,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:56:38,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:56:38,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:56:38,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:56:38,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:56:38,358 INFO L87 Difference]: Start difference. First operand 907 states and 1214 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-13 14:56:39,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:56:39,043 INFO L93 Difference]: Finished difference Result 1874 states and 2578 transitions. [2024-11-13 14:56:39,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:56:39,044 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 126 [2024-11-13 14:56:39,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:56:39,052 INFO L225 Difference]: With dead ends: 1874 [2024-11-13 14:56:39,052 INFO L226 Difference]: Without dead ends: 822 [2024-11-13 14:56:39,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2024-11-13 14:56:39,057 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 140 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:56:39,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 510 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:56:39,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-11-13 14:56:39,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 822. [2024-11-13 14:56:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 623 states have (on average 1.232744783306581) internal successors, (768), 636 states have internal predecessors, (768), 122 states have call successors, (122), 56 states have call predecessors, (122), 76 states have return successors, (186), 129 states have call predecessors, (186), 118 states have call successors, (186) [2024-11-13 14:56:39,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1076 transitions. [2024-11-13 14:56:39,333 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1076 transitions. Word has length 126 [2024-11-13 14:56:39,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:56:39,333 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1076 transitions. [2024-11-13 14:56:39,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-13 14:56:39,334 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1076 transitions. [2024-11-13 14:56:39,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-13 14:56:39,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:56:39,336 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:56:39,354 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 14:56:39,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-13 14:56:39,539 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:56:39,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:56:39,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1319578051, now seen corresponding path program 1 times [2024-11-13 14:56:39,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:56:39,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458564575] [2024-11-13 14:56:39,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:56:39,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:56:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:39,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:56:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:39,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:56:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:39,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:56:39,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:39,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:56:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:39,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:56:39,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:39,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:56:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:39,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:56:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:39,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:56:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:39,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 14:56:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:39,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 14:56:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:39,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:56:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:39,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 14:56:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:39,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 14:56:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:39,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-13 14:56:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:39,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 14:56:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:39,772 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-13 14:56:39,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:56:39,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458564575] [2024-11-13 14:56:39,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458564575] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:56:39,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365149133] [2024-11-13 14:56:39,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:56:39,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:56:39,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:56:39,776 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:56:39,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 14:56:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:40,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:56:40,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:56:40,232 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 14:56:40,232 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:56:40,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365149133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:56:40,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:56:40,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-13 14:56:40,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522285742] [2024-11-13 14:56:40,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:56:40,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:56:40,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:56:40,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:56:40,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:56:40,235 INFO L87 Difference]: Start difference. First operand 822 states and 1076 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 14:56:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:56:40,385 INFO L93 Difference]: Finished difference Result 1078 states and 1418 transitions. [2024-11-13 14:56:40,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:56:40,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 126 [2024-11-13 14:56:40,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:56:40,390 INFO L225 Difference]: With dead ends: 1078 [2024-11-13 14:56:40,390 INFO L226 Difference]: Without dead ends: 432 [2024-11-13 14:56:40,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 158 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 14:56:40,393 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 343 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 14:56:40,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 343 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:56:40,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-13 14:56:40,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 422. [2024-11-13 14:56:40,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 317 states have (on average 1.1798107255520505) internal successors, (374), 322 states have internal predecessors, (374), 64 states have call successors, (64), 34 states have call predecessors, (64), 40 states have return successors, (84), 65 states have call predecessors, (84), 62 states have call successors, (84) [2024-11-13 14:56:40,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 522 transitions. [2024-11-13 14:56:40,556 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 522 transitions. Word has length 126 [2024-11-13 14:56:40,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:56:40,556 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 522 transitions. [2024-11-13 14:56:40,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 14:56:40,557 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 522 transitions. [2024-11-13 14:56:40,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-13 14:56:40,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:56:40,559 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:56:40,583 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-13 14:56:40,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-13 14:56:40,760 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:56:40,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:56:40,760 INFO L85 PathProgramCache]: Analyzing trace with hash -573444271, now seen corresponding path program 1 times [2024-11-13 14:56:40,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:56:40,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736425182] [2024-11-13 14:56:40,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:56:40,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:56:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:43,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:56:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:43,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:56:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:43,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:56:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:43,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:56:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:43,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:56:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:43,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:56:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:44,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:56:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:44,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:56:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:44,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 14:56:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:44,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 14:56:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:44,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:56:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:44,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 14:56:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:44,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 14:56:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:44,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:56:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:45,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-13 14:56:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:45,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 14:56:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:45,162 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-13 14:56:45,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:56:45,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736425182] [2024-11-13 14:56:45,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736425182] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:56:45,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302308325] [2024-11-13 14:56:45,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:56:45,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:56:45,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:56:45,164 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:56:45,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-13 14:56:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:56:45,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 186 conjuncts are in the unsatisfiable core [2024-11-13 14:56:45,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:56:45,596 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 6 treesize of output 5 [2024-11-13 14:56:45,892 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 27 treesize of output 15 [2024-11-13 14:56:45,917 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:56:45,918 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 11 treesize of output 11 [2024-11-13 14:56:45,926 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 27 treesize of output 15 [2024-11-13 14:56:46,077 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-13 14:56:46,078 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 2 case distinctions, treesize of input 141 treesize of output 81 [2024-11-13 14:56:46,087 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 36 [2024-11-13 14:56:54,982 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 56 proven. 42 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 14:56:54,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:56:55,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302308325] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:56:55,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:56:55,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 29] total 47 [2024-11-13 14:56:55,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085891441] [2024-11-13 14:56:55,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:56:55,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-13 14:56:55,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:56:55,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-13 14:56:55,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2378, Unknown=0, NotChecked=0, Total=2550 [2024-11-13 14:56:55,554 INFO L87 Difference]: Start difference. First operand 422 states and 522 transitions. Second operand has 47 states, 44 states have (on average 3.5681818181818183) internal successors, (157), 42 states have internal predecessors, (157), 17 states have call successors, (33), 7 states have call predecessors, (33), 12 states have return successors, (31), 15 states have call predecessors, (31), 17 states have call successors, (31) [2024-11-13 14:57:08,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:57:08,374 INFO L93 Difference]: Finished difference Result 667 states and 867 transitions. [2024-11-13 14:57:08,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-13 14:57:08,375 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 3.5681818181818183) internal successors, (157), 42 states have internal predecessors, (157), 17 states have call successors, (33), 7 states have call predecessors, (33), 12 states have return successors, (31), 15 states have call predecessors, (31), 17 states have call successors, (31) Word has length 139 [2024-11-13 14:57:08,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:57:08,380 INFO L225 Difference]: With dead ends: 667 [2024-11-13 14:57:08,380 INFO L226 Difference]: Without dead ends: 562 [2024-11-13 14:57:08,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 140 SyntacticMatches, 13 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2481 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=747, Invalid=8373, Unknown=0, NotChecked=0, Total=9120 [2024-11-13 14:57:08,385 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 461 mSDsluCounter, 1811 mSDsCounter, 0 mSdLazyCounter, 3055 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1896 SdHoareTripleChecker+Invalid, 3319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 3055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:57:08,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1896 Invalid, 3319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 3055 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2024-11-13 14:57:08,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-11-13 14:57:08,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 480. [2024-11-13 14:57:08,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 364 states have (on average 1.195054945054945) internal successors, (435), 364 states have internal predecessors, (435), 72 states have call successors, (72), 35 states have call predecessors, (72), 43 states have return successors, (99), 80 states have call predecessors, (99), 70 states have call successors, (99) [2024-11-13 14:57:08,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 606 transitions. [2024-11-13 14:57:08,632 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 606 transitions. Word has length 139 [2024-11-13 14:57:08,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:57:08,633 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 606 transitions. [2024-11-13 14:57:08,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 3.5681818181818183) internal successors, (157), 42 states have internal predecessors, (157), 17 states have call successors, (33), 7 states have call predecessors, (33), 12 states have return successors, (31), 15 states have call predecessors, (31), 17 states have call successors, (31) [2024-11-13 14:57:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 606 transitions. [2024-11-13 14:57:08,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-13 14:57:08,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:57:08,637 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:57:08,664 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-13 14:57:08,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:57:08,838 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:57:08,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:57:08,838 INFO L85 PathProgramCache]: Analyzing trace with hash -511404657, now seen corresponding path program 1 times [2024-11-13 14:57:08,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:57:08,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108060942] [2024-11-13 14:57:08,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:57:08,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:57:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:09,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:57:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:09,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:57:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:09,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:57:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:09,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:57:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:09,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:57:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:09,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:57:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:09,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:57:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:09,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:57:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:09,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 14:57:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:09,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 14:57:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:09,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:57:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:09,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 14:57:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:09,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 14:57:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:10,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:57:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:10,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-13 14:57:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:10,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 14:57:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:10,482 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 19 proven. 24 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-13 14:57:10,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:57:10,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108060942] [2024-11-13 14:57:10,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108060942] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:57:10,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458044030] [2024-11-13 14:57:10,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:57:10,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:57:10,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:57:10,486 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:57:10,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-13 14:57:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:10,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 184 conjuncts are in the unsatisfiable core [2024-11-13 14:57:11,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:57:11,015 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 6 treesize of output 5 [2024-11-13 14:57:11,434 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 14:57:11,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 14:57:11,443 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 27 treesize of output 15 [2024-11-13 14:57:11,454 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 27 treesize of output 15 [2024-11-13 14:57:11,612 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-13 14:57:11,613 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 2 case distinctions, treesize of input 149 treesize of output 85 [2024-11-13 14:57:11,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 36 [2024-11-13 14:57:17,318 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 15 proven. 38 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-13 14:57:17,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:57:26,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458044030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:57:26,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:57:26,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 37 [2024-11-13 14:57:26,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932752805] [2024-11-13 14:57:26,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:57:26,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-13 14:57:26,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:57:26,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-13 14:57:26,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2494, Unknown=0, NotChecked=0, Total=2652 [2024-11-13 14:57:26,333 INFO L87 Difference]: Start difference. First operand 480 states and 606 transitions. Second operand has 37 states, 36 states have (on average 4.166666666666667) internal successors, (150), 35 states have internal predecessors, (150), 13 states have call successors, (32), 5 states have call predecessors, (32), 8 states have return successors, (30), 11 states have call predecessors, (30), 13 states have call successors, (30) [2024-11-13 14:57:33,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:57:33,770 INFO L93 Difference]: Finished difference Result 945 states and 1249 transitions. [2024-11-13 14:57:33,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-13 14:57:33,771 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 4.166666666666667) internal successors, (150), 35 states have internal predecessors, (150), 13 states have call successors, (32), 5 states have call predecessors, (32), 8 states have return successors, (30), 11 states have call predecessors, (30), 13 states have call successors, (30) Word has length 139 [2024-11-13 14:57:33,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:57:33,776 INFO L225 Difference]: With dead ends: 945 [2024-11-13 14:57:33,776 INFO L226 Difference]: Without dead ends: 549 [2024-11-13 14:57:33,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 157 SyntacticMatches, 15 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1509 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=441, Invalid=6365, Unknown=0, NotChecked=0, Total=6806 [2024-11-13 14:57:33,779 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 412 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 2270 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 2408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 2270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:57:33,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 1688 Invalid, 2408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 2270 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-13 14:57:33,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-11-13 14:57:34,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 510. [2024-11-13 14:57:34,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 388 states have (on average 1.1984536082474226) internal successors, (465), 394 states have internal predecessors, (465), 72 states have call successors, (72), 35 states have call predecessors, (72), 49 states have return successors, (114), 80 states have call predecessors, (114), 70 states have call successors, (114) [2024-11-13 14:57:34,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 651 transitions. [2024-11-13 14:57:34,007 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 651 transitions. Word has length 139 [2024-11-13 14:57:34,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:57:34,008 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 651 transitions. [2024-11-13 14:57:34,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 4.166666666666667) internal successors, (150), 35 states have internal predecessors, (150), 13 states have call successors, (32), 5 states have call predecessors, (32), 8 states have return successors, (30), 11 states have call predecessors, (30), 13 states have call successors, (30) [2024-11-13 14:57:34,008 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 651 transitions. [2024-11-13 14:57:34,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-13 14:57:34,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:57:34,010 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:57:34,034 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-13 14:57:34,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:57:34,211 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:57:34,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:57:34,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1020877747, now seen corresponding path program 1 times [2024-11-13 14:57:34,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:57:34,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415966837] [2024-11-13 14:57:34,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:57:34,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:57:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:34,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:57:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:34,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 14:57:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:34,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 14:57:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:34,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:57:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:34,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:57:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:34,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:57:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:34,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:57:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:34,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 14:57:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:34,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 14:57:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:34,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 14:57:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:34,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-13 14:57:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:34,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 14:57:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:34,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 14:57:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:34,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-13 14:57:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:34,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-13 14:57:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:34,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 14:57:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:34,990 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-13 14:57:34,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:57:34,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415966837] [2024-11-13 14:57:34,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415966837] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:57:34,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477238311] [2024-11-13 14:57:34,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:57:34,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:57:34,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:57:34,993 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:57:35,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-13 14:57:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:35,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 14:57:35,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:57:35,938 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-13 14:57:35,938 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:57:35,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477238311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:57:35,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:57:35,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 22 [2024-11-13 14:57:35,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287079488] [2024-11-13 14:57:35,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:57:35,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 14:57:35,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:57:35,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 14:57:35,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2024-11-13 14:57:35,940 INFO L87 Difference]: Start difference. First operand 510 states and 651 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 5 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-13 14:57:36,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:57:36,989 INFO L93 Difference]: Finished difference Result 1023 states and 1381 transitions. [2024-11-13 14:57:36,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 14:57:36,990 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 5 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 139 [2024-11-13 14:57:36,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:57:36,994 INFO L225 Difference]: With dead ends: 1023 [2024-11-13 14:57:36,994 INFO L226 Difference]: Without dead ends: 525 [2024-11-13 14:57:36,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 14:57:36,997 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 147 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:57:36,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 848 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 14:57:36,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-11-13 14:57:37,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 505. [2024-11-13 14:57:37,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 382 states have (on average 1.1910994764397906) internal successors, (455), 393 states have internal predecessors, (455), 71 states have call successors, (71), 35 states have call predecessors, (71), 51 states have return successors, (112), 76 states have call predecessors, (112), 69 states have call successors, (112) [2024-11-13 14:57:37,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 638 transitions. [2024-11-13 14:57:37,268 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 638 transitions. Word has length 139 [2024-11-13 14:57:37,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:57:37,269 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 638 transitions. [2024-11-13 14:57:37,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 5 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-13 14:57:37,269 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 638 transitions. [2024-11-13 14:57:37,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-13 14:57:37,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:57:37,271 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 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] [2024-11-13 14:57:37,298 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-13 14:57:37,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-13 14:57:37,475 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:57:37,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:57:37,476 INFO L85 PathProgramCache]: Analyzing trace with hash -2054413800, now seen corresponding path program 1 times [2024-11-13 14:57:37,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:57:37,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590147046] [2024-11-13 14:57:37,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:57:37,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:57:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:57:37,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:57:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:57:37,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:57:37,796 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:57:37,797 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:57:37,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 14:57:37,806 INFO L407 BasicCegarLoop]: Path program histogram: [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 14:57:37,925 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:57:37,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:57:37 BoogieIcfgContainer [2024-11-13 14:57:37,931 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:57:37,932 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:57:37,935 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:57:37,936 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:57:37,937 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:44:38" (3/4) ... [2024-11-13 14:57:37,938 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 14:57:38,055 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 14:57:38,056 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:57:38,058 INFO L158 Benchmark]: Toolchain (without parser) took 782989.06ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 87.5MB in the beginning and 614.6MB in the end (delta: -527.1MB). Peak memory consumption was 115.0MB. Max. memory is 16.1GB. [2024-11-13 14:57:38,059 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 167.8MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:57:38,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2319.03ms. Allocated memory is still 117.4MB. Free memory was 87.5MB in the beginning and 43.6MB in the end (delta: 43.9MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. [2024-11-13 14:57:38,060 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.85ms. Allocated memory is still 117.4MB. Free memory was 43.6MB in the beginning and 71.0MB in the end (delta: -27.4MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2024-11-13 14:57:38,060 INFO L158 Benchmark]: Boogie Preprocessor took 80.22ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 66.8MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:57:38,061 INFO L158 Benchmark]: RCFGBuilder took 853.24ms. Allocated memory is still 117.4MB. Free memory was 66.8MB in the beginning and 71.4MB in the end (delta: -4.6MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. [2024-11-13 14:57:38,061 INFO L158 Benchmark]: TraceAbstraction took 779497.99ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 70.8MB in the beginning and 623.0MB in the end (delta: -552.2MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. [2024-11-13 14:57:38,061 INFO L158 Benchmark]: Witness Printer took 123.60ms. Allocated memory is still 755.0MB. Free memory was 623.0MB in the beginning and 614.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:57:38,063 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.33ms. Allocated memory is still 167.8MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2319.03ms. Allocated memory is still 117.4MB. Free memory was 87.5MB in the beginning and 43.6MB in the end (delta: 43.9MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.85ms. Allocated memory is still 117.4MB. Free memory was 43.6MB in the beginning and 71.0MB in the end (delta: -27.4MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.22ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 66.8MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 853.24ms. Allocated memory is still 117.4MB. Free memory was 66.8MB in the beginning and 71.4MB in the end (delta: -4.6MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. * TraceAbstraction took 779497.99ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 70.8MB in the beginning and 623.0MB in the end (delta: -552.2MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. * Witness Printer took 123.60ms. Allocated memory is still 755.0MB. Free memory was 623.0MB in the beginning and 614.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 223]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7326] static __thread int tl_last_error = 0; VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7363] CALL aws_linked_list_front_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) | 1), 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) | 1), list={7:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6755] COND TRUE i < length [L6758] struct aws_linked_list_node *node = malloc(sizeof(struct aws_linked_list_node)); [L6759] curr->next = node [L6760] node->prev = curr [L6761] curr = node [L6755] i++ VAL [curr={-2:0}, i=1, length=(((unsigned __int128) 1 << 64) | 1), list={7:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6755] COND FALSE !(i < length) VAL [curr={-2: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] EXPR list.head.next [L7349] struct aws_linked_list_node *old_first = list.head.next; [L7352] CALL, EXPR aws_linked_list_empty(&list) VAL [\old(list)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4684] CALL assume_abort_if_not((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] [L4684] RET assume_abort_if_not((list)) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4685] EXPR list->head.next [L4685] return list->head.next == &list->tail; [L7352] RET, EXPR aws_linked_list_empty(&list) VAL [list={7:0}, old_first={-2:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7352] CALL assume_abort_if_not(!aws_linked_list_empty(&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] [L7352] RET assume_abort_if_not(!aws_linked_list_empty(&list)) VAL [list={7:0}, old_first={-2:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7355] CALL aws_linked_list_front(&list) VAL [\old(list)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4995] CALL, EXPR aws_linked_list_is_valid(list) VAL [\old(list)={7:0}, 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={-2: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={-2:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [\old(node)={-2:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next VAL [\old(node)={-2:0}, node={-2: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)={-2:0}, node={-2:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={-2:0}, node={-2: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)={-2: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={-2: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); [L4995] RET, EXPR aws_linked_list_is_valid(list) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4995] 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] [L4995] RET assume_abort_if_not((aws_linked_list_is_valid(list))) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4996] CALL, EXPR aws_linked_list_empty(list) VAL [\old(list)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4684] CALL assume_abort_if_not((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] [L4684] RET assume_abort_if_not((list)) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4685] EXPR list->head.next [L4685] return list->head.next == &list->tail; [L4996] RET, EXPR aws_linked_list_empty(list) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4996] CALL assume_abort_if_not((!aws_linked_list_empty(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] [L4996] RET assume_abort_if_not((!aws_linked_list_empty(list))) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4997] EXPR list->head.next [L4997] struct aws_linked_list_node *rval = list->head.next; [L4998] CALL, EXPR aws_linked_list_is_valid(list) VAL [\old(list)={7:0}, 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={-2: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={-2:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [\old(node)={-2:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next VAL [\old(node)={-2:0}, node={-2: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)={-2:0}, node={-2:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={-2:0}, node={-2: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)={-2: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={-2: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); [L4998] RET, EXPR aws_linked_list_is_valid(list) VAL [\old(list)={7:0}, list={7:0}, rval={-2:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4998] 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 9 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 779.3s, OverallIterations: 22, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 561.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 91 mSolverCounterUnknown, 3445 SdHoareTripleChecker+Valid, 210.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3392 mSDsluCounter, 24592 SdHoareTripleChecker+Invalid, 207.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3353 IncrementalHoareTripleChecker+Unchecked, 22310 mSDsCounter, 1537 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19246 IncrementalHoareTripleChecker+Invalid, 24227 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1537 mSolverCounterUnsat, 2282 mSDtfsCounter, 19246 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4124 GetRequests, 3191 SyntacticMatches, 98 SemanticMatches, 835 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 12249 ImplicationChecksByTransitivity, 486.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=907occurred in iteration=16, InterpolantAutomatonStates: 446, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 766 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 203.4s InterpolantComputationTime, 4572 NumberOfCodeBlocks, 4572 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 5067 ConstructedInterpolants, 664 QuantifiedInterpolants, 69303 SizeOfPredicates, 125 NumberOfNonLiveVariables, 8898 ConjunctsInSsa, 1043 ConjunctsInUnsatCore, 45 InterpolantComputations, 12 PerfectInterpolantSequences, 3490/4078 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 14:57:38,286 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-13 14:57:38,333 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9aa9c99-ae35-4807-a366-f71e42401395/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 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