./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB --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 cf0e38c8708298b6c669a06e84f1e143a32d8eb782624bd4425e7da323fbf6a8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:15:08,077 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:15:08,196 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-27 23:15:08,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:15:08,205 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:15:08,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:15:08,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:15:08,254 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:15:08,255 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 23:15:08,255 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 23:15:08,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:15:08,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:15:08,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:15:08,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:15:08,257 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:15:08,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:15:08,257 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 23:15:08,257 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 23:15:08,258 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:15:08,258 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 23:15:08,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:15:08,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 23:15:08,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 23:15:08,258 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:15:08,258 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:15:08,258 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:15:08,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:15:08,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:15:08,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:15:08,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:15:08,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:15:08,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:15:08,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:15:08,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:15:08,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:15:08,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:15:08,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:15:08,260 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 23:15:08,260 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 23:15:08,260 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 23:15:08,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 23:15:08,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:15:08,262 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:15:08,262 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:15:08,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:15:08,262 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_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB 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 -> cf0e38c8708298b6c669a06e84f1e143a32d8eb782624bd4425e7da323fbf6a8 [2024-11-27 23:15:08,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:15:08,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:15:08,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:15:08,675 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:15:08,675 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:15:08,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i [2024-11-27 23:15:12,023 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/data/223a388e0/3518851b3731423c95b494efd9bb0cea/FLAG504f5bee2 [2024-11-27 23:15:12,745 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:15:12,746 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i [2024-11-27 23:15:12,799 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/data/223a388e0/3518851b3731423c95b494efd9bb0cea/FLAG504f5bee2 [2024-11-27 23:15:12,818 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/data/223a388e0/3518851b3731423c95b494efd9bb0cea [2024-11-27 23:15:12,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:15:12,823 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:15:12,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:15:12,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:15:12,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:15:12,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:15:12" (1/1) ... [2024-11-27 23:15:12,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@535e1c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:15:12, skipping insertion in model container [2024-11-27 23:15:12,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:15:12" (1/1) ... [2024-11-27 23:15:12,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:15:13,227 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_9574eb4c-0440-4564-a57b-936d9227b620/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i[4495,4508] [2024-11-27 23:15:13,236 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_9574eb4c-0440-4564-a57b-936d9227b620/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i[4555,4568] [2024-11-27 23:15:14,245 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 23:15:14,246 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 23:15:14,247 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 23:15:14,248 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 23:15:14,249 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 23:15:14,274 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 23:15:14,275 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 23:15:14,277 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 23:15:14,278 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 23:15:14,281 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 23:15:14,283 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 23:15:14,284 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 23:15:14,284 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 23:15:15,062 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_9574eb4c-0440-4564-a57b-936d9227b620/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i[150686,150699] [2024-11-27 23:15:15,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:15:15,087 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:15:15,117 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_9574eb4c-0440-4564-a57b-936d9227b620/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i[4495,4508] [2024-11-27 23:15:15,118 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_9574eb4c-0440-4564-a57b-936d9227b620/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i[4555,4568] [2024-11-27 23:15:15,258 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 23:15:15,259 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 23:15:15,259 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 23:15:15,260 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 23:15:15,261 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 23:15:15,279 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 23:15:15,282 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 23:15:15,285 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 23:15:15,285 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 23:15:15,286 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 23:15:15,287 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 23:15:15,288 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 23:15:15,288 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-27 23:15:15,399 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_9574eb4c-0440-4564-a57b-936d9227b620/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i[150686,150699] [2024-11-27 23:15:15,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:15:15,615 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:15:15,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:15:15 WrapperNode [2024-11-27 23:15:15,616 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:15:15,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:15:15,617 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:15:15,617 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:15:15,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:15:15" (1/1) ... [2024-11-27 23:15:15,687 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:15:15" (1/1) ... [2024-11-27 23:15:15,724 INFO L138 Inliner]: procedures = 668, calls = 1039, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 141 [2024-11-27 23:15:15,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:15:15,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:15:15,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:15:15,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:15:15,738 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:15:15" (1/1) ... [2024-11-27 23:15:15,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:15:15" (1/1) ... [2024-11-27 23:15:15,743 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:15:15" (1/1) ... [2024-11-27 23:15:15,770 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 5, 17]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2024-11-27 23:15:15,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:15:15" (1/1) ... [2024-11-27 23:15:15,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:15:15" (1/1) ... [2024-11-27 23:15:15,787 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:15:15" (1/1) ... [2024-11-27 23:15:15,788 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:15:15" (1/1) ... [2024-11-27 23:15:15,792 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:15:15" (1/1) ... [2024-11-27 23:15:15,795 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:15:15" (1/1) ... [2024-11-27 23:15:15,797 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:15:15" (1/1) ... [2024-11-27 23:15:15,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:15:15,803 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:15:15,803 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:15:15,803 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:15:15,805 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:15:15" (1/1) ... [2024-11-27 23:15:15,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:15:15,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:15:15,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:15:15,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:15:15,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 23:15:15,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-27 23:15:15,899 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-27 23:15:15,899 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-27 23:15:15,899 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-27 23:15:15,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 23:15:15,902 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-27 23:15:15,902 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-27 23:15:15,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 23:15:15,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-27 23:15:15,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-27 23:15:15,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-27 23:15:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:15:15,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:15:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-27 23:15:15,904 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-27 23:15:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 23:15:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-27 23:15:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-27 23:15:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-27 23:15:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-27 23:15:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-27 23:15:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-27 23:15:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-27 23:15:15,905 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-27 23:15:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 23:15:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-27 23:15:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-27 23:15:16,227 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:15:16,230 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:15:16,643 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-11-27 23:15:16,644 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:15:16,661 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:15:16,661 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-27 23:15:16,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:15:16 BoogieIcfgContainer [2024-11-27 23:15:16,661 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:15:16,668 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:15:16,668 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:15:16,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:15:16,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:15:12" (1/3) ... [2024-11-27 23:15:16,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@940c888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:15:16, skipping insertion in model container [2024-11-27 23:15:16,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:15:15" (2/3) ... [2024-11-27 23:15:16,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@940c888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:15:16, skipping insertion in model container [2024-11-27 23:15:16,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:15:16" (3/3) ... [2024-11-27 23:15:16,678 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_begin_harness_negated.i [2024-11-27 23:15:16,698 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:15:16,700 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_begin_harness_negated.i that has 6 procedures, 69 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-27 23:15:16,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:15:16,793 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;@53bf39f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:15:16,793 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 23:15:16,798 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 49 states have (on average 1.346938775510204) internal successors, (66), 50 states have internal predecessors, (66), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-27 23:15:16,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-27 23:15:16,809 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:15:16,810 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:15:16,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:15:16,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:15:16,820 INFO L85 PathProgramCache]: Analyzing trace with hash 324213296, now seen corresponding path program 1 times [2024-11-27 23:15:16,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:15:16,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810063150] [2024-11-27 23:15:16,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:15:16,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:15:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:15:17,447 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-27 23:15:17,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:15:17,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810063150] [2024-11-27 23:15:17,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810063150] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:15:17,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629544479] [2024-11-27 23:15:17,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:15:17,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:15:17,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:15:17,456 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:15:17,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 23:15:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:15:17,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-27 23:15:17,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:15:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-27 23:15:17,822 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:15:17,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629544479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:15:17,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 23:15:17,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-27 23:15:17,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179202103] [2024-11-27 23:15:17,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:15:17,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 23:15:17,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:15:17,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 23:15:17,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 23:15:17,862 INFO L87 Difference]: Start difference. First operand has 69 states, 49 states have (on average 1.346938775510204) internal successors, (66), 50 states have internal predecessors, (66), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-27 23:15:17,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:15:17,906 INFO L93 Difference]: Finished difference Result 130 states and 186 transitions. [2024-11-27 23:15:17,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 23:15:17,909 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2024-11-27 23:15:17,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:15:17,918 INFO L225 Difference]: With dead ends: 130 [2024-11-27 23:15:17,918 INFO L226 Difference]: Without dead ends: 64 [2024-11-27 23:15:17,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 23:15:17,926 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:15:17,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:15:17,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-27 23:15:17,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-27 23:15:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-27 23:15:17,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2024-11-27 23:15:17,976 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 68 [2024-11-27 23:15:17,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:15:17,976 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2024-11-27 23:15:17,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-27 23:15:17,977 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2024-11-27 23:15:17,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-27 23:15:17,980 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:15:17,980 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:15:17,993 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 23:15:18,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-27 23:15:18,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:15:18,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:15:18,186 INFO L85 PathProgramCache]: Analyzing trace with hash -962094674, now seen corresponding path program 1 times [2024-11-27 23:15:18,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:15:18,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351484410] [2024-11-27 23:15:18,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:15:18,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:15:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:15:19,472 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-27 23:15:19,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:15:19,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351484410] [2024-11-27 23:15:19,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351484410] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:15:19,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923881773] [2024-11-27 23:15:19,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:15:19,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:15:19,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:15:19,479 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:15:19,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 23:15:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:15:19,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-27 23:15:19,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:15:19,933 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-27 23:15:19,964 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-27 23:15:20,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:15:20,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:15:20,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2024-11-27 23:15:20,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:15:20,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:15:20,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:15:20,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2024-11-27 23:15:23,175 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-27 23:15:23,175 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:15:23,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923881773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:15:23,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 23:15:23,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2024-11-27 23:15:23,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553932251] [2024-11-27 23:15:23,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:15:23,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 23:15:23,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:15:23,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 23:15:23,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-27 23:15:23,179 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-27 23:15:24,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:15:24,346 INFO L93 Difference]: Finished difference Result 174 states and 234 transitions. [2024-11-27 23:15:24,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 23:15:24,347 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 68 [2024-11-27 23:15:24,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:15:24,351 INFO L225 Difference]: With dead ends: 174 [2024-11-27 23:15:24,351 INFO L226 Difference]: Without dead ends: 122 [2024-11-27 23:15:24,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-27 23:15:24,355 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 54 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-27 23:15:24,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 446 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-27 23:15:24,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-27 23:15:24,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 117. [2024-11-27 23:15:24,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 85 states have internal predecessors, (109), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-27 23:15:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 155 transitions. [2024-11-27 23:15:24,401 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 155 transitions. Word has length 68 [2024-11-27 23:15:24,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:15:24,403 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 155 transitions. [2024-11-27 23:15:24,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-27 23:15:24,404 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 155 transitions. [2024-11-27 23:15:24,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-27 23:15:24,407 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:15:24,407 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:15:24,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-27 23:15:24,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:15:24,608 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:15:24,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:15:24,609 INFO L85 PathProgramCache]: Analyzing trace with hash 536177768, now seen corresponding path program 1 times [2024-11-27 23:15:24,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:15:24,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22136264] [2024-11-27 23:15:24,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:15:24,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:15:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:15:25,214 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-27 23:15:25,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:15:25,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22136264] [2024-11-27 23:15:25,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22136264] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:15:25,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882659545] [2024-11-27 23:15:25,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:15:25,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:15:25,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:15:25,218 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:15:25,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 23:15:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:15:25,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-27 23:15:25,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:15:25,630 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2024-11-27 23:15:25,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 128 [2024-11-27 23:15:25,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-11-27 23:15:25,737 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:15:25,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-11-27 23:15:25,780 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:15:25,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 13 [2024-11-27 23:15:25,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 23:15:54,856 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (= .cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| (store .cse1 .cse2 .cse0)) .cse0))))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse3))) (= .cse4 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| (store .cse4 .cse5 .cse3)) .cse3)))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|))))) is different from true [2024-11-27 23:15:59,389 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_aws_linked_list_begin_~list#1.offset| 24))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base|) .cse5))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (= .cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| (store .cse1 .cse2 .cse0)) .cse0))))))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse4))) (= .cse3 (select (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_1) |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base| (store .cse3 .cse5 .cse4)) .cse4)))) (= .cse4 |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base|)) (<= |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base| .cse4) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse8))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6))) (= .cse7 (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| (store .cse7 .cse8 .cse6)) .cse6)))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|)))) (<= 2 |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base|)))) is different from true [2024-11-27 23:16:27,657 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (= .cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| (store .cse1 .cse2 .cse0)) .cse0))))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|) (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|) .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse3))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4| (store .cse4 .cse5 .cse3)) .cse3) .cse4)))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|) (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|) .cse8))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| (store .cse7 .cse8 .cse6)) .cse6) .cse7)))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse11))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| .cse9) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse9))) (= .cse10 (select (store (store |c_#memory_$Pointer$#2.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| (store .cse10 .cse11 .cse9)) .cse9)))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|))))) is different from true [2024-11-27 23:16:28,065 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_aws_linked_list_begin_~list#1.offset| 24))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base|) .cse5))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (= .cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| (store .cse1 .cse2 .cse0)) .cse0))))))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse4))) (= .cse3 (select (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_1) |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base| (store .cse3 .cse5 .cse4)) .cse4)))) (= .cse4 |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base|)) (<= |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base| .cse4) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|) (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|) .cse8))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4| .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4| (store .cse7 .cse8 .cse6)) .cse6) .cse7)))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|) (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|) .cse11))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| .cse9) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse9))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| (store .cse10 .cse11 .cse9)) .cse9) .cse10)))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse14 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse14))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| .cse12) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse12))) (= .cse13 (select (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| (store .cse13 .cse14 .cse12)) .cse12)))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|)))) (<= 2 |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base|)))) is different from true [2024-11-27 23:16:28,408 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (= .cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_7| (store .cse1 .cse2 .cse0)) .cse0))))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|) (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|) .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse3))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4| (store .cse4 .cse5 .cse3)) .cse3) .cse4)))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|) (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|) .cse8))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| (store .cse7 .cse8 .cse6)) .cse6) .cse7)))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_6| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_6| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|) .cse11))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6| .cse9) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse9))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6| (store .cse10 .cse11 .cse9)) .cse9) .cse10))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_6| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|) (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_6| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse14 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse14))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| .cse12) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse12))) (= .cse13 (select (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8| (store .cse13 .cse14 .cse12)) .cse12)))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_8|))))) is different from true [2024-11-27 23:16:31,721 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-27 23:16:31,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:16:36,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:16:36,456 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 318 treesize of output 310 [2024-11-27 23:16:36,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 146 [2024-11-27 23:16:36,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 117 [2024-11-27 23:16:52,336 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-27 23:16:52,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882659545] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-27 23:16:52,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:16:52,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6, 20] total 33 [2024-11-27 23:16:52,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581851997] [2024-11-27 23:16:52,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:16:52,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 23:16:52,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:16:52,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 23:16:52,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=627, Unknown=49, NotChecked=280, Total=1056 [2024-11-27 23:16:52,340 INFO L87 Difference]: Start difference. First operand 117 states and 155 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-27 23:17:02,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:17:02,439 INFO L93 Difference]: Finished difference Result 197 states and 277 transitions. [2024-11-27 23:17:02,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 23:17:02,439 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 68 [2024-11-27 23:17:02,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:17:02,442 INFO L225 Difference]: With dead ends: 197 [2024-11-27 23:17:02,442 INFO L226 Difference]: Without dead ends: 136 [2024-11-27 23:17:02,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 91.9s TimeCoverageRelationStatistics Valid=146, Invalid=1081, Unknown=53, NotChecked=360, Total=1640 [2024-11-27 23:17:02,445 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 156 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 23:17:02,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 421 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 23:17:02,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-27 23:17:02,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 119. [2024-11-27 23:17:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 87 states have internal predecessors, (111), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-27 23:17:02,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 157 transitions. [2024-11-27 23:17:02,475 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 157 transitions. Word has length 68 [2024-11-27 23:17:02,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:17:02,476 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 157 transitions. [2024-11-27 23:17:02,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-27 23:17:02,476 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 157 transitions. [2024-11-27 23:17:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-27 23:17:02,478 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:17:02,478 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:17:02,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-27 23:17:02,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:17:02,679 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:17:02,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:17:02,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1561950370, now seen corresponding path program 1 times [2024-11-27 23:17:02,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:17:02,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394644800] [2024-11-27 23:17:02,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:17:02,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:17:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:17:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-27 23:17:03,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:17:03,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394644800] [2024-11-27 23:17:03,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394644800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:17:03,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:17:03,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:17:03,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330808616] [2024-11-27 23:17:03,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:17:03,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 23:17:03,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:17:03,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 23:17:03,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:17:03,144 INFO L87 Difference]: Start difference. First operand 119 states and 157 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-27 23:17:03,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:17:03,218 INFO L93 Difference]: Finished difference Result 137 states and 182 transitions. [2024-11-27 23:17:03,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 23:17:03,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 68 [2024-11-27 23:17:03,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:17:03,224 INFO L225 Difference]: With dead ends: 137 [2024-11-27 23:17:03,224 INFO L226 Difference]: Without dead ends: 135 [2024-11-27 23:17:03,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:17:03,225 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 3 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:17:03,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 392 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:17:03,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-27 23:17:03,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2024-11-27 23:17:03,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 93 states have (on average 1.2795698924731183) internal successors, (119), 97 states have internal predecessors, (119), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2024-11-27 23:17:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 177 transitions. [2024-11-27 23:17:03,250 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 177 transitions. Word has length 68 [2024-11-27 23:17:03,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:17:03,251 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 177 transitions. [2024-11-27 23:17:03,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-27 23:17:03,251 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 177 transitions. [2024-11-27 23:17:03,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-27 23:17:03,253 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:17:03,253 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:17:03,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 23:17:03,253 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:17:03,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:17:03,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1823129154, now seen corresponding path program 1 times [2024-11-27 23:17:03,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:17:03,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059350256] [2024-11-27 23:17:03,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:17:03,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:17:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:17:03,738 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-27 23:17:03,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:17:03,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059350256] [2024-11-27 23:17:03,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059350256] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:17:03,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160513541] [2024-11-27 23:17:03,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:17:03,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:17:03,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:17:03,742 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:17:03,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 23:17:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:17:03,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-27 23:17:03,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:17:04,139 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-27 23:17:04,139 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:17:04,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160513541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:17:04,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 23:17:04,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2024-11-27 23:17:04,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151910912] [2024-11-27 23:17:04,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:17:04,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 23:17:04,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:17:04,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 23:17:04,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-11-27 23:17:04,142 INFO L87 Difference]: Start difference. First operand 133 states and 177 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-27 23:17:04,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:17:04,438 INFO L93 Difference]: Finished difference Result 258 states and 345 transitions. [2024-11-27 23:17:04,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 23:17:04,439 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2024-11-27 23:17:04,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:17:04,442 INFO L225 Difference]: With dead ends: 258 [2024-11-27 23:17:04,443 INFO L226 Difference]: Without dead ends: 137 [2024-11-27 23:17:04,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-11-27 23:17:04,449 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 95 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:17:04,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 308 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:17:04,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-27 23:17:04,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2024-11-27 23:17:04,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 93 states have (on average 1.2580645161290323) internal successors, (117), 97 states have internal predecessors, (117), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2024-11-27 23:17:04,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 175 transitions. [2024-11-27 23:17:04,494 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 175 transitions. Word has length 70 [2024-11-27 23:17:04,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:17:04,496 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 175 transitions. [2024-11-27 23:17:04,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-27 23:17:04,496 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 175 transitions. [2024-11-27 23:17:04,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-27 23:17:04,502 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:17:04,502 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:17:04,516 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-27 23:17:04,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:17:04,703 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:17:04,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:17:04,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1713818576, now seen corresponding path program 1 times [2024-11-27 23:17:04,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:17:04,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826585520] [2024-11-27 23:17:04,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:17:04,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:17:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:17:05,227 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-27 23:17:05,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:17:05,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826585520] [2024-11-27 23:17:05,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826585520] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:17:05,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978824921] [2024-11-27 23:17:05,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:17:05,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:17:05,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:17:05,230 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:17:05,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 23:17:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:17:05,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-27 23:17:05,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:17:05,660 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-27 23:17:05,661 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:17:05,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978824921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:17:05,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 23:17:05,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2024-11-27 23:17:05,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674117512] [2024-11-27 23:17:05,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:17:05,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 23:17:05,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:17:05,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 23:17:05,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2024-11-27 23:17:05,665 INFO L87 Difference]: Start difference. First operand 133 states and 175 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-27 23:17:06,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:17:06,088 INFO L93 Difference]: Finished difference Result 270 states and 361 transitions. [2024-11-27 23:17:06,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 23:17:06,088 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2024-11-27 23:17:06,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:17:06,091 INFO L225 Difference]: With dead ends: 270 [2024-11-27 23:17:06,091 INFO L226 Difference]: Without dead ends: 147 [2024-11-27 23:17:06,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2024-11-27 23:17:06,093 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 109 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 23:17:06,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 344 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 23:17:06,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-27 23:17:06,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 135. [2024-11-27 23:17:06,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 99 states have internal predecessors, (119), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2024-11-27 23:17:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 177 transitions. [2024-11-27 23:17:06,119 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 177 transitions. Word has length 72 [2024-11-27 23:17:06,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:17:06,119 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 177 transitions. [2024-11-27 23:17:06,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-27 23:17:06,120 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 177 transitions. [2024-11-27 23:17:06,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-27 23:17:06,122 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:17:06,122 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:17:06,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-27 23:17:06,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-27 23:17:06,323 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:17:06,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:17:06,324 INFO L85 PathProgramCache]: Analyzing trace with hash 831638789, now seen corresponding path program 1 times [2024-11-27 23:17:06,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:17:06,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716903524] [2024-11-27 23:17:06,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:17:06,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:17:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:17:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-27 23:17:06,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:17:06,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716903524] [2024-11-27 23:17:06,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716903524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:17:06,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:17:06,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 23:17:06,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515073146] [2024-11-27 23:17:06,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:17:06,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 23:17:06,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:17:06,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 23:17:06,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-27 23:17:06,693 INFO L87 Difference]: Start difference. First operand 135 states and 177 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-27 23:17:06,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:17:06,904 INFO L93 Difference]: Finished difference Result 272 states and 361 transitions. [2024-11-27 23:17:06,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 23:17:06,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2024-11-27 23:17:06,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:17:06,906 INFO L225 Difference]: With dead ends: 272 [2024-11-27 23:17:06,906 INFO L226 Difference]: Without dead ends: 147 [2024-11-27 23:17:06,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-27 23:17:06,908 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 27 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:17:06,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 406 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:17:06,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-27 23:17:06,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 137. [2024-11-27 23:17:06,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 97 states have (on average 1.2474226804123711) internal successors, (121), 101 states have internal predecessors, (121), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2024-11-27 23:17:06,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 179 transitions. [2024-11-27 23:17:06,934 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 179 transitions. Word has length 73 [2024-11-27 23:17:06,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:17:06,934 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 179 transitions. [2024-11-27 23:17:06,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-27 23:17:06,935 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 179 transitions. [2024-11-27 23:17:06,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-27 23:17:06,936 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:17:06,936 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:17:06,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 23:17:06,937 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:17:06,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:17:06,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1979775390, now seen corresponding path program 1 times [2024-11-27 23:17:06,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:17:06,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208100026] [2024-11-27 23:17:06,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:17:06,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:17:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:17:07,301 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-27 23:17:07,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:17:07,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208100026] [2024-11-27 23:17:07,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208100026] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:17:07,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749480107] [2024-11-27 23:17:07,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:17:07,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:17:07,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:17:07,304 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:17:07,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 23:17:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:17:07,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-27 23:17:07,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:17:07,555 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-27 23:17:07,562 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-27 23:17:07,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:07,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:07,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2024-11-27 23:17:07,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:07,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:07,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:07,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2024-11-27 23:17:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-27 23:17:08,375 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:17:08,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749480107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:17:08,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 23:17:08,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2024-11-27 23:17:08,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571269258] [2024-11-27 23:17:08,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:17:08,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 23:17:08,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:17:08,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 23:17:08,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-27 23:17:08,377 INFO L87 Difference]: Start difference. First operand 137 states and 179 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-27 23:17:09,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:17:09,391 INFO L93 Difference]: Finished difference Result 221 states and 292 transitions. [2024-11-27 23:17:09,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 23:17:09,392 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 74 [2024-11-27 23:17:09,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:17:09,394 INFO L225 Difference]: With dead ends: 221 [2024-11-27 23:17:09,394 INFO L226 Difference]: Without dead ends: 159 [2024-11-27 23:17:09,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-11-27 23:17:09,395 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 76 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-27 23:17:09,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 466 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-27 23:17:09,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-27 23:17:09,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2024-11-27 23:17:09,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 113 states have (on average 1.2654867256637168) internal successors, (143), 119 states have internal predecessors, (143), 27 states have call successors, (27), 11 states have call predecessors, (27), 15 states have return successors, (37), 25 states have call predecessors, (37), 25 states have call successors, (37) [2024-11-27 23:17:09,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 207 transitions. [2024-11-27 23:17:09,423 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 207 transitions. Word has length 74 [2024-11-27 23:17:09,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:17:09,424 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 207 transitions. [2024-11-27 23:17:09,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-27 23:17:09,424 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 207 transitions. [2024-11-27 23:17:09,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-27 23:17:09,425 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:17:09,425 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:17:09,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-27 23:17:09,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-27 23:17:09,626 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:17:09,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:17:09,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1103756384, now seen corresponding path program 1 times [2024-11-27 23:17:09,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:17:09,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290509761] [2024-11-27 23:17:09,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:17:09,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:17:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:17:10,303 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-27 23:17:10,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:17:10,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290509761] [2024-11-27 23:17:10,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290509761] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:17:10,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729415751] [2024-11-27 23:17:10,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:17:10,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:17:10,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:17:10,306 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:17:10,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 23:17:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:17:10,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-27 23:17:10,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:17:10,554 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-27 23:17:10,557 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-27 23:17:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-27 23:17:11,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:17:12,389 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-27 23:17:12,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729415751] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:17:12,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:17:12,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 12] total 31 [2024-11-27 23:17:12,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097032975] [2024-11-27 23:17:12,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:17:12,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-27 23:17:12,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:17:12,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-27 23:17:12,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2024-11-27 23:17:12,392 INFO L87 Difference]: Start difference. First operand 156 states and 207 transitions. Second operand has 31 states, 31 states have (on average 3.4193548387096775) internal successors, (106), 29 states have internal predecessors, (106), 10 states have call successors, (24), 3 states have call predecessors, (24), 7 states have return successors, (23), 8 states have call predecessors, (23), 10 states have call successors, (23) [2024-11-27 23:17:14,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:17:14,729 INFO L93 Difference]: Finished difference Result 523 states and 739 transitions. [2024-11-27 23:17:14,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-27 23:17:14,730 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.4193548387096775) internal successors, (106), 29 states have internal predecessors, (106), 10 states have call successors, (24), 3 states have call predecessors, (24), 7 states have return successors, (23), 8 states have call predecessors, (23), 10 states have call successors, (23) Word has length 74 [2024-11-27 23:17:14,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:17:14,733 INFO L225 Difference]: With dead ends: 523 [2024-11-27 23:17:14,733 INFO L226 Difference]: Without dead ends: 388 [2024-11-27 23:17:14,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 135 SyntacticMatches, 6 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2024-11-27 23:17:14,735 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 336 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-27 23:17:14,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1123 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-27 23:17:14,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-27 23:17:14,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 313. [2024-11-27 23:17:14,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 237 states have (on average 1.2869198312236287) internal successors, (305), 250 states have internal predecessors, (305), 46 states have call successors, (46), 18 states have call predecessors, (46), 29 states have return successors, (76), 44 states have call predecessors, (76), 43 states have call successors, (76) [2024-11-27 23:17:14,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 427 transitions. [2024-11-27 23:17:14,786 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 427 transitions. Word has length 74 [2024-11-27 23:17:14,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:17:14,786 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 427 transitions. [2024-11-27 23:17:14,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.4193548387096775) internal successors, (106), 29 states have internal predecessors, (106), 10 states have call successors, (24), 3 states have call predecessors, (24), 7 states have return successors, (23), 8 states have call predecessors, (23), 10 states have call successors, (23) [2024-11-27 23:17:14,786 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 427 transitions. [2024-11-27 23:17:14,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-27 23:17:14,788 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:17:14,788 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:17:14,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-27 23:17:14,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:17:14,989 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:17:14,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:17:14,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1063081634, now seen corresponding path program 1 times [2024-11-27 23:17:14,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:17:14,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433877680] [2024-11-27 23:17:14,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:17:14,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:17:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:17:15,160 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-27 23:17:15,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:17:15,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433877680] [2024-11-27 23:17:15,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433877680] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:17:15,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954411711] [2024-11-27 23:17:15,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:17:15,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:17:15,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:17:15,163 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:17:15,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-27 23:17:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:17:15,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-27 23:17:15,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:17:15,438 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-27 23:17:15,438 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:17:15,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954411711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:17:15,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 23:17:15,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2024-11-27 23:17:15,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125470993] [2024-11-27 23:17:15,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:17:15,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 23:17:15,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:17:15,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 23:17:15,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-27 23:17:15,440 INFO L87 Difference]: Start difference. First operand 313 states and 427 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-27 23:17:15,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:17:15,627 INFO L93 Difference]: Finished difference Result 627 states and 869 transitions. [2024-11-27 23:17:15,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 23:17:15,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2024-11-27 23:17:15,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:17:15,631 INFO L225 Difference]: With dead ends: 627 [2024-11-27 23:17:15,631 INFO L226 Difference]: Without dead ends: 384 [2024-11-27 23:17:15,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-27 23:17:15,633 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 97 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:17:15,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 269 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:17:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-27 23:17:15,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 348. [2024-11-27 23:17:15,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 267 states have (on average 1.2921348314606742) internal successors, (345), 283 states have internal predecessors, (345), 48 states have call successors, (48), 18 states have call predecessors, (48), 32 states have return successors, (82), 46 states have call predecessors, (82), 45 states have call successors, (82) [2024-11-27 23:17:15,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 475 transitions. [2024-11-27 23:17:15,683 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 475 transitions. Word has length 74 [2024-11-27 23:17:15,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:17:15,683 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 475 transitions. [2024-11-27 23:17:15,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-27 23:17:15,683 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 475 transitions. [2024-11-27 23:17:15,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-27 23:17:15,685 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:17:15,686 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:17:15,698 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-27 23:17:15,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-27 23:17:15,886 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:17:15,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:17:15,887 INFO L85 PathProgramCache]: Analyzing trace with hash 533903658, now seen corresponding path program 1 times [2024-11-27 23:17:15,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:17:15,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959474180] [2024-11-27 23:17:15,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:17:15,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:17:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:17:16,198 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-27 23:17:16,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:17:16,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959474180] [2024-11-27 23:17:16,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959474180] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:17:16,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12571304] [2024-11-27 23:17:16,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:17:16,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:17:16,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:17:16,201 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:17:16,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-27 23:17:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:17:16,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-27 23:17:16,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:17:16,500 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-27 23:17:16,520 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-27 23:17:16,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:16,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:16,602 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-27 23:17:16,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:16,609 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-27 23:17:16,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:16,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-27 23:17:16,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:16,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-27 23:17:16,742 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2024-11-27 23:17:16,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 120 [2024-11-27 23:17:16,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 91 [2024-11-27 23:17:16,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:16,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 34 [2024-11-27 23:17:16,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:16,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:16,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2024-11-27 23:17:16,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2024-11-27 23:17:18,403 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-27 23:17:18,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:17:18,972 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset| 16))) (and (forall ((v_ArrVal_712 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_712))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse2) 0)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_714 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_714))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2024-11-27 23:17:19,027 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset| 16))) (and (forall ((v_ArrVal_707 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_707 1)) (forall ((v_ArrVal_709 Int) (v_ArrVal_714 (Array Int Int)) (v_subst_1 Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_709)) v_ArrVal_707 v_ArrVal_714))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_1))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse2) 0)))) (forall ((v_ArrVal_707 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_707 1)) (forall ((v_ArrVal_712 (Array Int Int))) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_707)) v_ArrVal_707 v_ArrVal_712))) (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_707))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse2) 0)))))) is different from false [2024-11-27 23:17:19,147 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2024-11-27 23:17:19,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 144 [2024-11-27 23:17:19,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:17:19,164 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 174 treesize of output 172 [2024-11-27 23:17:19,176 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 132 treesize of output 120 [2024-11-27 23:17:19,267 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-27 23:17:19,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:17:19,425 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 61 treesize of output 63 [2024-11-27 23:17:19,460 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:17:19,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:19,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:17:19,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 46 [2024-11-27 23:17:19,485 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 71 treesize of output 57 [2024-11-27 23:17:19,488 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:17:19,492 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:17:19,500 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-27 23:17:19,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 37 [2024-11-27 23:17:19,508 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:17:19,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 23:17:19,568 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 1 not checked. [2024-11-27 23:17:19,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12571304] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:17:19,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:17:19,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 23 [2024-11-27 23:17:19,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395183254] [2024-11-27 23:17:19,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:17:19,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-27 23:17:19,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:17:19,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-27 23:17:19,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=364, Unknown=2, NotChecked=78, Total=506 [2024-11-27 23:17:19,570 INFO L87 Difference]: Start difference. First operand 348 states and 475 transitions. Second operand has 23 states, 22 states have (on average 4.2272727272727275) internal successors, (93), 22 states have internal predecessors, (93), 9 states have call successors, (24), 3 states have call predecessors, (24), 7 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2024-11-27 23:17:22,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:17:22,313 INFO L93 Difference]: Finished difference Result 923 states and 1285 transitions. [2024-11-27 23:17:22,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-27 23:17:22,313 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.2272727272727275) internal successors, (93), 22 states have internal predecessors, (93), 9 states have call successors, (24), 3 states have call predecessors, (24), 7 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Word has length 76 [2024-11-27 23:17:22,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:17:22,317 INFO L225 Difference]: With dead ends: 923 [2024-11-27 23:17:22,318 INFO L226 Difference]: Without dead ends: 582 [2024-11-27 23:17:22,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 130 SyntacticMatches, 9 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=158, Invalid=1038, Unknown=2, NotChecked=134, Total=1332 [2024-11-27 23:17:22,321 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 82 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 327 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-27 23:17:22,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1249 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 758 Invalid, 0 Unknown, 327 Unchecked, 1.9s Time] [2024-11-27 23:17:22,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-11-27 23:17:22,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 558. [2024-11-27 23:17:22,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 428 states have (on average 1.294392523364486) internal successors, (554), 454 states have internal predecessors, (554), 77 states have call successors, (77), 29 states have call predecessors, (77), 52 states have return successors, (123), 74 states have call predecessors, (123), 72 states have call successors, (123) [2024-11-27 23:17:22,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 754 transitions. [2024-11-27 23:17:22,449 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 754 transitions. Word has length 76 [2024-11-27 23:17:22,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:17:22,450 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 754 transitions. [2024-11-27 23:17:22,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.2272727272727275) internal successors, (93), 22 states have internal predecessors, (93), 9 states have call successors, (24), 3 states have call predecessors, (24), 7 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2024-11-27 23:17:22,450 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 754 transitions. [2024-11-27 23:17:22,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-27 23:17:22,454 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:17:22,454 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:17:22,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-27 23:17:22,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:17:22,661 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:17:22,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:17:22,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1142728353, now seen corresponding path program 1 times [2024-11-27 23:17:22,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:17:22,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911841645] [2024-11-27 23:17:22,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:17:22,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:17:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:17:23,157 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-27 23:17:23,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:17:23,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911841645] [2024-11-27 23:17:23,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911841645] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:17:23,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884766667] [2024-11-27 23:17:23,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:17:23,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:17:23,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:17:23,162 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:17:23,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-27 23:17:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:17:23,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-27 23:17:23,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:17:23,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-27 23:17:23,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:23,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-27 23:17:23,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-27 23:17:23,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:23,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-27 23:17:23,644 INFO L349 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2024-11-27 23:17:23,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 105 [2024-11-27 23:17:23,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:23,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:23,654 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 28 treesize of output 25 [2024-11-27 23:17:23,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2024-11-27 23:17:23,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:23,669 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 55 treesize of output 20 [2024-11-27 23:17:23,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2024-11-27 23:17:24,419 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-27 23:17:24,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:17:25,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:17:25,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 126 [2024-11-27 23:17:25,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:17:25,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 154 [2024-11-27 23:17:25,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:17:25,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 625 treesize of output 559 [2024-11-27 23:17:25,277 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 545 treesize of output 529 [2024-11-27 23:17:25,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:17:25,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 660 treesize of output 674 [2024-11-27 23:17:25,369 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 667 treesize of output 659 [2024-11-27 23:17:25,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:17:25,410 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 701 treesize of output 677 [2024-11-27 23:17:26,011 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-27 23:17:26,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:17:26,250 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 205 treesize of output 205 [2024-11-27 23:17:26,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-27 23:17:26,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:17:26,899 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 258 treesize of output 258 [2024-11-27 23:17:27,327 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-27 23:17:27,510 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 30 treesize of output 24 [2024-11-27 23:17:27,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:27,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:27,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:27,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:17:27,682 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 223 treesize of output 193 [2024-11-27 23:17:28,336 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-27 23:17:28,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884766667] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:17:28,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:17:28,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 13] total 30 [2024-11-27 23:17:28,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039840565] [2024-11-27 23:17:28,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:17:28,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-27 23:17:28,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:17:28,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-27 23:17:28,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=766, Unknown=1, NotChecked=0, Total=870 [2024-11-27 23:17:28,338 INFO L87 Difference]: Start difference. First operand 558 states and 754 transitions. Second operand has 30 states, 29 states have (on average 4.0344827586206895) internal successors, (117), 28 states have internal predecessors, (117), 7 states have call successors, (25), 3 states have call predecessors, (25), 6 states have return successors, (24), 5 states have call predecessors, (24), 7 states have call successors, (24) [2024-11-27 23:17:31,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:17:31,771 INFO L93 Difference]: Finished difference Result 1228 states and 1684 transitions. [2024-11-27 23:17:31,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-27 23:17:31,772 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.0344827586206895) internal successors, (117), 28 states have internal predecessors, (117), 7 states have call successors, (25), 3 states have call predecessors, (25), 6 states have return successors, (24), 5 states have call predecessors, (24), 7 states have call successors, (24) Word has length 89 [2024-11-27 23:17:31,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:17:31,777 INFO L225 Difference]: With dead ends: 1228 [2024-11-27 23:17:31,777 INFO L226 Difference]: Without dead ends: 710 [2024-11-27 23:17:31,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=473, Invalid=3066, Unknown=1, NotChecked=0, Total=3540 [2024-11-27 23:17:31,781 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 235 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-27 23:17:31,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 1428 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-27 23:17:31,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-27 23:17:31,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 601. [2024-11-27 23:17:31,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 458 states have (on average 1.279475982532751) internal successors, (586), 497 states have internal predecessors, (586), 77 states have call successors, (77), 29 states have call predecessors, (77), 65 states have return successors, (151), 74 states have call predecessors, (151), 72 states have call successors, (151) [2024-11-27 23:17:31,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 814 transitions. [2024-11-27 23:17:31,895 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 814 transitions. Word has length 89 [2024-11-27 23:17:31,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:17:31,895 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 814 transitions. [2024-11-27 23:17:31,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.0344827586206895) internal successors, (117), 28 states have internal predecessors, (117), 7 states have call successors, (25), 3 states have call predecessors, (25), 6 states have return successors, (24), 5 states have call predecessors, (24), 7 states have call successors, (24) [2024-11-27 23:17:31,895 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 814 transitions. [2024-11-27 23:17:31,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-27 23:17:31,899 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:17:31,899 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:17:31,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-27 23:17:32,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:17:32,099 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:17:32,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:17:32,100 INFO L85 PathProgramCache]: Analyzing trace with hash 455903537, now seen corresponding path program 1 times [2024-11-27 23:17:32,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:17:32,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917581667] [2024-11-27 23:17:32,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:17:32,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:17:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:17:32,557 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-27 23:17:32,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:17:32,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917581667] [2024-11-27 23:17:32,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917581667] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:17:32,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057620300] [2024-11-27 23:17:32,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:17:32,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:17:32,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:17:32,560 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:17:32,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-27 23:17:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:17:32,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-27 23:17:32,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:17:32,871 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-27 23:17:32,874 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-27 23:17:33,635 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-27 23:17:33,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:17:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-27 23:17:34,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057620300] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:17:34,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:17:34,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 12] total 31 [2024-11-27 23:17:34,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494744962] [2024-11-27 23:17:34,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:17:34,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-27 23:17:34,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:17:34,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-27 23:17:34,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=836, Unknown=0, NotChecked=0, Total=930 [2024-11-27 23:17:34,286 INFO L87 Difference]: Start difference. First operand 601 states and 814 transitions. Second operand has 31 states, 30 states have (on average 4.1) internal successors, (123), 31 states have internal predecessors, (123), 10 states have call successors, (22), 3 states have call predecessors, (22), 6 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) [2024-11-27 23:17:37,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:17:37,501 INFO L93 Difference]: Finished difference Result 2307 states and 3201 transitions. [2024-11-27 23:17:37,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-27 23:17:37,502 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.1) internal successors, (123), 31 states have internal predecessors, (123), 10 states have call successors, (22), 3 states have call predecessors, (22), 6 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) Word has length 91 [2024-11-27 23:17:37,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:17:37,515 INFO L225 Difference]: With dead ends: 2307 [2024-11-27 23:17:37,515 INFO L226 Difference]: Without dead ends: 1580 [2024-11-27 23:17:37,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 169 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=488, Invalid=3544, Unknown=0, NotChecked=0, Total=4032 [2024-11-27 23:17:37,523 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 310 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 1638 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 1758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-27 23:17:37,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1510 Invalid, 1758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1638 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-27 23:17:37,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2024-11-27 23:17:37,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1241. [2024-11-27 23:17:37,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 948 states have (on average 1.2784810126582278) internal successors, (1212), 1021 states have internal predecessors, (1212), 163 states have call successors, (163), 59 states have call predecessors, (163), 129 states have return successors, (305), 160 states have call predecessors, (305), 153 states have call successors, (305) [2024-11-27 23:17:37,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1680 transitions. [2024-11-27 23:17:37,752 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1680 transitions. Word has length 91 [2024-11-27 23:17:37,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:17:37,752 INFO L471 AbstractCegarLoop]: Abstraction has 1241 states and 1680 transitions. [2024-11-27 23:17:37,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.1) internal successors, (123), 31 states have internal predecessors, (123), 10 states have call successors, (22), 3 states have call predecessors, (22), 6 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) [2024-11-27 23:17:37,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1680 transitions. [2024-11-27 23:17:37,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-27 23:17:37,757 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:17:37,757 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:17:37,768 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-27 23:17:37,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-27 23:17:37,962 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:17:37,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:17:37,962 INFO L85 PathProgramCache]: Analyzing trace with hash 728140017, now seen corresponding path program 1 times [2024-11-27 23:17:37,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:17:37,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669914812] [2024-11-27 23:17:37,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:17:37,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:17:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:17:38,075 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-27 23:17:38,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:17:38,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669914812] [2024-11-27 23:17:38,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669914812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:17:38,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627642590] [2024-11-27 23:17:38,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:17:38,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:17:38,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:17:38,080 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:17:38,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-27 23:17:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:17:38,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 23:17:38,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:17:38,347 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-27 23:17:38,347 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:17:38,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627642590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:17:38,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 23:17:38,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-27 23:17:38,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885957907] [2024-11-27 23:17:38,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:17:38,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:17:38,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:17:38,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:17:38,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:17:38,349 INFO L87 Difference]: Start difference. First operand 1241 states and 1680 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-27 23:17:38,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:17:38,565 INFO L93 Difference]: Finished difference Result 2444 states and 3436 transitions. [2024-11-27 23:17:38,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:17:38,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 91 [2024-11-27 23:17:38,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:17:38,575 INFO L225 Difference]: With dead ends: 2444 [2024-11-27 23:17:38,575 INFO L226 Difference]: Without dead ends: 1235 [2024-11-27 23:17:38,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:17:38,582 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:17:38,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 234 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:17:38,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2024-11-27 23:17:38,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1233. [2024-11-27 23:17:38,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 940 states have (on average 1.2553191489361701) internal successors, (1180), 1013 states have internal predecessors, (1180), 163 states have call successors, (163), 59 states have call predecessors, (163), 129 states have return successors, (305), 160 states have call predecessors, (305), 153 states have call successors, (305) [2024-11-27 23:17:38,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1648 transitions. [2024-11-27 23:17:38,887 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1648 transitions. Word has length 91 [2024-11-27 23:17:38,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:17:38,888 INFO L471 AbstractCegarLoop]: Abstraction has 1233 states and 1648 transitions. [2024-11-27 23:17:38,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-27 23:17:38,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1648 transitions. [2024-11-27 23:17:38,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-27 23:17:38,892 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:17:38,892 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:17:38,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-27 23:17:39,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-27 23:17:39,093 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:17:39,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:17:39,093 INFO L85 PathProgramCache]: Analyzing trace with hash -308447055, now seen corresponding path program 1 times [2024-11-27 23:17:39,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:17:39,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139465842] [2024-11-27 23:17:39,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:17:39,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:17:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:17:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-27 23:17:39,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:17:39,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139465842] [2024-11-27 23:17:39,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139465842] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:17:39,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854070747] [2024-11-27 23:17:39,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:17:39,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:17:39,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:17:39,195 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:17:39,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-27 23:17:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:17:39,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 23:17:39,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:17:39,473 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-27 23:17:39,474 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:17:39,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854070747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:17:39,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 23:17:39,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-27 23:17:39,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773565365] [2024-11-27 23:17:39,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:17:39,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:17:39,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:17:39,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:17:39,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:17:39,476 INFO L87 Difference]: Start difference. First operand 1233 states and 1648 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-27 23:17:39,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:17:39,581 INFO L93 Difference]: Finished difference Result 1612 states and 2201 transitions. [2024-11-27 23:17:39,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:17:39,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 91 [2024-11-27 23:17:39,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:17:39,586 INFO L225 Difference]: With dead ends: 1612 [2024-11-27 23:17:39,586 INFO L226 Difference]: Without dead ends: 347 [2024-11-27 23:17:39,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:17:39,592 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 1 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:17:39,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 232 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:17:39,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-27 23:17:39,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 328. [2024-11-27 23:17:39,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 247 states have (on average 1.2307692307692308) internal successors, (304), 265 states have internal predecessors, (304), 48 states have call successors, (48), 17 states have call predecessors, (48), 32 states have return successors, (75), 45 states have call predecessors, (75), 44 states have call successors, (75) [2024-11-27 23:17:39,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 427 transitions. [2024-11-27 23:17:39,648 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 427 transitions. Word has length 91 [2024-11-27 23:17:39,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:17:39,648 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 427 transitions. [2024-11-27 23:17:39,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-27 23:17:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 427 transitions. [2024-11-27 23:17:39,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-27 23:17:39,651 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:17:39,651 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:17:39,662 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-27 23:17:39,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-27 23:17:39,852 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:17:39,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:17:39,852 INFO L85 PathProgramCache]: Analyzing trace with hash 583206622, now seen corresponding path program 1 times [2024-11-27 23:17:39,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:17:39,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045554764] [2024-11-27 23:17:39,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:17:39,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:17:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:17:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-27 23:17:40,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:17:40,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045554764] [2024-11-27 23:17:40,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045554764] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:17:40,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579673783] [2024-11-27 23:17:40,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:17:40,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:17:40,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:17:40,861 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:17:40,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-27 23:17:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:17:41,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-27 23:17:41,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:17:41,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-27 23:17:41,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:41,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-27 23:17:41,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:41,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:41,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2024-11-27 23:17:41,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2024-11-27 23:17:42,293 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 44 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 23:17:42,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:17:42,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:17:42,817 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 42 treesize of output 35 [2024-11-27 23:17:42,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:17:42,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 185 [2024-11-27 23:17:42,846 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 184 treesize of output 176 [2024-11-27 23:17:42,995 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-27 23:17:43,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:17:43,023 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 85 treesize of output 87 [2024-11-27 23:17:43,121 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-27 23:17:43,135 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 8 treesize of output 6 [2024-11-27 23:17:43,433 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-27 23:17:43,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579673783] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:17:43,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:17:43,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 33 [2024-11-27 23:17:43,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151590654] [2024-11-27 23:17:43,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:17:43,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-27 23:17:43,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:17:43,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-27 23:17:43,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=952, Unknown=7, NotChecked=0, Total=1056 [2024-11-27 23:17:43,436 INFO L87 Difference]: Start difference. First operand 328 states and 427 transitions. Second operand has 33 states, 30 states have (on average 4.9) internal successors, (147), 33 states have internal predecessors, (147), 13 states have call successors, (25), 3 states have call predecessors, (25), 6 states have return successors, (24), 10 states have call predecessors, (24), 13 states have call successors, (24) [2024-11-27 23:17:45,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:17:45,490 INFO L93 Difference]: Finished difference Result 613 states and 801 transitions. [2024-11-27 23:17:45,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-27 23:17:45,491 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 4.9) internal successors, (147), 33 states have internal predecessors, (147), 13 states have call successors, (25), 3 states have call predecessors, (25), 6 states have return successors, (24), 10 states have call predecessors, (24), 13 states have call successors, (24) Word has length 92 [2024-11-27 23:17:45,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:17:45,495 INFO L225 Difference]: With dead ends: 613 [2024-11-27 23:17:45,495 INFO L226 Difference]: Without dead ends: 384 [2024-11-27 23:17:45,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 164 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=191, Invalid=1694, Unknown=7, NotChecked=0, Total=1892 [2024-11-27 23:17:45,498 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 103 mSDsluCounter, 2109 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2226 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-27 23:17:45,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2226 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1562 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-27 23:17:45,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-27 23:17:45,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 336. [2024-11-27 23:17:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 254 states have (on average 1.2244094488188977) internal successors, (311), 272 states have internal predecessors, (311), 48 states have call successors, (48), 18 states have call predecessors, (48), 33 states have return successors, (75), 45 states have call predecessors, (75), 44 states have call successors, (75) [2024-11-27 23:17:45,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 434 transitions. [2024-11-27 23:17:45,565 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 434 transitions. Word has length 92 [2024-11-27 23:17:45,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:17:45,565 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 434 transitions. [2024-11-27 23:17:45,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 4.9) internal successors, (147), 33 states have internal predecessors, (147), 13 states have call successors, (25), 3 states have call predecessors, (25), 6 states have return successors, (24), 10 states have call predecessors, (24), 13 states have call successors, (24) [2024-11-27 23:17:45,566 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 434 transitions. [2024-11-27 23:17:45,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-27 23:17:45,567 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:17:45,567 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:17:45,578 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-27 23:17:45,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-27 23:17:45,768 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:17:45,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:17:45,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2063721006, now seen corresponding path program 2 times [2024-11-27 23:17:45,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:17:45,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360316034] [2024-11-27 23:17:45,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:17:45,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:17:45,824 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:17:45,825 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:17:46,250 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-27 23:17:46,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:17:46,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360316034] [2024-11-27 23:17:46,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360316034] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:17:46,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694349494] [2024-11-27 23:17:46,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:17:46,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:17:46,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:17:46,253 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:17:46,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-27 23:17:46,553 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:17:46,554 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:17:46,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-27 23:17:46,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:17:46,718 INFO L349 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2024-11-27 23:17:46,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 104 [2024-11-27 23:17:46,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2024-11-27 23:17:46,740 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:17:46,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-27 23:17:46,769 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 55 treesize of output 20 [2024-11-27 23:17:47,457 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-27 23:17:47,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:17:47,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:17:47,732 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 162 treesize of output 163 [2024-11-27 23:17:47,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 156 [2024-11-27 23:17:47,825 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-27 23:17:47,830 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-27 23:17:47,838 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-27 23:17:47,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-27 23:17:47,967 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-27 23:17:47,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694349494] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-27 23:17:47,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:17:47,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8, 12] total 26 [2024-11-27 23:17:47,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876736740] [2024-11-27 23:17:47,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:17:47,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 23:17:47,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:17:47,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 23:17:47,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2024-11-27 23:17:47,969 INFO L87 Difference]: Start difference. First operand 336 states and 434 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-27 23:17:48,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:17:48,367 INFO L93 Difference]: Finished difference Result 537 states and 674 transitions. [2024-11-27 23:17:48,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 23:17:48,368 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 102 [2024-11-27 23:17:48,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:17:48,371 INFO L225 Difference]: With dead ends: 537 [2024-11-27 23:17:48,371 INFO L226 Difference]: Without dead ends: 336 [2024-11-27 23:17:48,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 178 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2024-11-27 23:17:48,373 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 18 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 23:17:48,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 531 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 23:17:48,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-27 23:17:48,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2024-11-27 23:17:48,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 254 states have (on average 1.2086614173228347) internal successors, (307), 272 states have internal predecessors, (307), 48 states have call successors, (48), 18 states have call predecessors, (48), 33 states have return successors, (75), 45 states have call predecessors, (75), 44 states have call successors, (75) [2024-11-27 23:17:48,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 430 transitions. [2024-11-27 23:17:48,440 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 430 transitions. Word has length 102 [2024-11-27 23:17:48,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:17:48,441 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 430 transitions. [2024-11-27 23:17:48,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-27 23:17:48,441 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 430 transitions. [2024-11-27 23:17:48,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-27 23:17:48,443 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:17:48,443 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:17:48,454 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-27 23:17:48,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-27 23:17:48,648 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:17:48,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:17:48,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1042652652, now seen corresponding path program 3 times [2024-11-27 23:17:48,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:17:48,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947788043] [2024-11-27 23:17:48,648 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 23:17:48,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:17:48,685 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-27 23:17:48,685 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:17:49,003 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-27 23:17:49,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:17:49,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947788043] [2024-11-27 23:17:49,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947788043] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:17:49,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842913271] [2024-11-27 23:17:49,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 23:17:49,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:17:49,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:17:49,006 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:17:49,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-27 23:17:49,284 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-27 23:17:49,284 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:17:49,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-27 23:17:49,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:17:49,378 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-27 23:17:49,379 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:17:49,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842913271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:17:49,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 23:17:49,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 12 [2024-11-27 23:17:49,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183324919] [2024-11-27 23:17:49,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:17:49,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 23:17:49,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:17:49,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 23:17:49,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-27 23:17:49,380 INFO L87 Difference]: Start difference. First operand 336 states and 430 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-27 23:17:49,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:17:49,519 INFO L93 Difference]: Finished difference Result 648 states and 831 transitions. [2024-11-27 23:17:49,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 23:17:49,520 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 102 [2024-11-27 23:17:49,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:17:49,522 INFO L225 Difference]: With dead ends: 648 [2024-11-27 23:17:49,522 INFO L226 Difference]: Without dead ends: 360 [2024-11-27 23:17:49,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-27 23:17:49,524 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 1 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:17:49,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 524 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:17:49,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-27 23:17:49,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 342. [2024-11-27 23:17:49,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 260 states have (on average 1.2038461538461538) internal successors, (313), 278 states have internal predecessors, (313), 48 states have call successors, (48), 18 states have call predecessors, (48), 33 states have return successors, (75), 45 states have call predecessors, (75), 44 states have call successors, (75) [2024-11-27 23:17:49,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 436 transitions. [2024-11-27 23:17:49,592 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 436 transitions. Word has length 102 [2024-11-27 23:17:49,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:17:49,592 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 436 transitions. [2024-11-27 23:17:49,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-27 23:17:49,592 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 436 transitions. [2024-11-27 23:17:49,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-27 23:17:49,594 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:17:49,595 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:17:49,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-27 23:17:49,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-27 23:17:49,799 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:17:49,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:17:49,799 INFO L85 PathProgramCache]: Analyzing trace with hash -2135127745, now seen corresponding path program 2 times [2024-11-27 23:17:49,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:17:49,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113861141] [2024-11-27 23:17:49,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:17:49,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:17:49,858 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:17:49,858 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:17:50,110 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-27 23:17:50,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:17:50,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113861141] [2024-11-27 23:17:50,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113861141] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:17:50,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537487426] [2024-11-27 23:17:50,111 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:17:50,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:17:50,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:17:50,113 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:17:50,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-27 23:17:50,434 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:17:50,434 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:17:50,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-27 23:17:50,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:17:50,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-27 23:17:50,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-27 23:17:50,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-11-27 23:17:50,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:50,618 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 23 treesize of output 16 [2024-11-27 23:17:50,629 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 31 treesize of output 36 [2024-11-27 23:17:50,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:50,635 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 23 treesize of output 16 [2024-11-27 23:17:50,750 INFO L349 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2024-11-27 23:17:50,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 110 [2024-11-27 23:17:50,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:50,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:17:50,757 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 35 treesize of output 30 [2024-11-27 23:17:50,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 68 [2024-11-27 23:17:50,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-11-27 23:18:02,003 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 14 refuted. 28 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-27 23:18:02,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:18:02,909 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| Int)) (or (forall ((v_ArrVal_1550 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| v_ArrVal_1550))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42|))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse2) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| Int)) (or (forall ((v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1543 Int) (v_subst_3 Int)) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_1543)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| v_ArrVal_1548))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_3))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse2) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_42| 1)))))) is different from false [2024-11-27 23:18:03,007 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2024-11-27 23:18:03,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 242 treesize of output 228 [2024-11-27 23:18:03,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:18:03,024 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 149 treesize of output 147 [2024-11-27 23:18:03,033 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 132 treesize of output 120 [2024-11-27 23:18:03,068 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-27 23:18:03,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:18:03,155 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 139 treesize of output 141 [2024-11-27 23:18:03,296 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:18:03,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:18:03,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:18:03,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 46 [2024-11-27 23:18:03,313 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 71 treesize of output 57 [2024-11-27 23:18:03,316 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:18:03,319 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:18:03,329 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-27 23:18:03,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 37 [2024-11-27 23:18:03,332 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:18:03,334 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 11 treesize of output 7 [2024-11-27 23:18:03,438 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 1 not checked. [2024-11-27 23:18:03,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537487426] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:18:03,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:18:03,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 24, 11] total 37 [2024-11-27 23:18:03,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402686649] [2024-11-27 23:18:03,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:18:03,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-27 23:18:03,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:18:03,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-27 23:18:03,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1041, Unknown=97, NotChecked=68, Total=1332 [2024-11-27 23:18:03,441 INFO L87 Difference]: Start difference. First operand 342 states and 436 transitions. Second operand has 37 states, 33 states have (on average 4.212121212121212) internal successors, (139), 32 states have internal predecessors, (139), 14 states have call successors, (27), 7 states have call predecessors, (27), 10 states have return successors, (26), 13 states have call predecessors, (26), 14 states have call successors, (26) [2024-11-27 23:18:19,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:18:19,768 INFO L93 Difference]: Finished difference Result 932 states and 1136 transitions. [2024-11-27 23:18:19,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-27 23:18:19,769 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 4.212121212121212) internal successors, (139), 32 states have internal predecessors, (139), 14 states have call successors, (27), 7 states have call predecessors, (27), 10 states have return successors, (26), 13 states have call predecessors, (26), 14 states have call successors, (26) Word has length 103 [2024-11-27 23:18:19,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:18:19,772 INFO L225 Difference]: With dead ends: 932 [2024-11-27 23:18:19,772 INFO L226 Difference]: Without dead ends: 473 [2024-11-27 23:18:19,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 176 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=416, Invalid=4140, Unknown=278, NotChecked=136, Total=4970 [2024-11-27 23:18:19,776 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 156 mSDsluCounter, 2380 mSDsCounter, 0 mSdLazyCounter, 1914 mSolverCounterSat, 22 mSolverCounterUnsat, 712 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 2526 SdHoareTripleChecker+Invalid, 2880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1914 IncrementalHoareTripleChecker+Invalid, 712 IncrementalHoareTripleChecker+Unknown, 232 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:18:19,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 2526 Invalid, 2880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1914 Invalid, 712 Unknown, 232 Unchecked, 9.2s Time] [2024-11-27 23:18:19,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-27 23:18:19,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 401. [2024-11-27 23:18:19,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 312 states have (on average 1.189102564102564) internal successors, (371), 326 states have internal predecessors, (371), 52 states have call successors, (52), 25 states have call predecessors, (52), 36 states have return successors, (68), 49 states have call predecessors, (68), 48 states have call successors, (68) [2024-11-27 23:18:19,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 491 transitions. [2024-11-27 23:18:19,890 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 491 transitions. Word has length 103 [2024-11-27 23:18:19,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:18:19,890 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 491 transitions. [2024-11-27 23:18:19,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 4.212121212121212) internal successors, (139), 32 states have internal predecessors, (139), 14 states have call successors, (27), 7 states have call predecessors, (27), 10 states have return successors, (26), 13 states have call predecessors, (26), 14 states have call successors, (26) [2024-11-27 23:18:19,890 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 491 transitions. [2024-11-27 23:18:19,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-27 23:18:19,892 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:18:19,892 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:18:19,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-27 23:18:20,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:18:20,093 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:18:20,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:18:20,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1289903271, now seen corresponding path program 1 times [2024-11-27 23:18:20,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:18:20,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972225879] [2024-11-27 23:18:20,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:18:20,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:18:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:18:20,695 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 11 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-27 23:18:20,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:18:20,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972225879] [2024-11-27 23:18:20,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972225879] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:18:20,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471443987] [2024-11-27 23:18:20,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:18:20,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:18:20,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:18:20,698 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:18:20,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-27 23:18:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:18:21,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-27 23:18:21,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:18:21,057 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-27 23:18:21,618 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 39 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-27 23:18:21,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:18:22,308 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 243 treesize of output 227 [2024-11-27 23:18:22,316 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 51 treesize of output 47 [2024-11-27 23:18:22,322 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 53 treesize of output 45 [2024-11-27 23:18:22,417 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-27 23:18:22,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471443987] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:18:22,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:18:22,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 15] total 37 [2024-11-27 23:18:22,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713931169] [2024-11-27 23:18:22,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:18:22,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-27 23:18:22,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:18:22,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-27 23:18:22,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2024-11-27 23:18:22,420 INFO L87 Difference]: Start difference. First operand 401 states and 491 transitions. Second operand has 37 states, 35 states have (on average 3.857142857142857) internal successors, (135), 37 states have internal predecessors, (135), 14 states have call successors, (25), 3 states have call predecessors, (25), 9 states have return successors, (25), 12 states have call predecessors, (25), 14 states have call successors, (25) [2024-11-27 23:18:26,445 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-27 23:18:30,501 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-27 23:18:34,562 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-27 23:18:36,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:18:36,880 INFO L93 Difference]: Finished difference Result 745 states and 929 transitions. [2024-11-27 23:18:36,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-27 23:18:36,880 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 3.857142857142857) internal successors, (135), 37 states have internal predecessors, (135), 14 states have call successors, (25), 3 states have call predecessors, (25), 9 states have return successors, (25), 12 states have call predecessors, (25), 14 states have call successors, (25) Word has length 103 [2024-11-27 23:18:36,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:18:36,884 INFO L225 Difference]: With dead ends: 745 [2024-11-27 23:18:36,884 INFO L226 Difference]: Without dead ends: 653 [2024-11-27 23:18:36,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=425, Invalid=3115, Unknown=0, NotChecked=0, Total=3540 [2024-11-27 23:18:36,886 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 256 mSDsluCounter, 1813 mSDsCounter, 0 mSdLazyCounter, 1812 mSolverCounterSat, 87 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1929 SdHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1812 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2024-11-27 23:18:36,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1929 Invalid, 1902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1812 Invalid, 3 Unknown, 0 Unchecked, 13.6s Time] [2024-11-27 23:18:36,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2024-11-27 23:18:37,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 565. [2024-11-27 23:18:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 441 states have (on average 1.1972789115646258) internal successors, (528), 464 states have internal predecessors, (528), 72 states have call successors, (72), 31 states have call predecessors, (72), 51 states have return successors, (107), 69 states have call predecessors, (107), 67 states have call successors, (107) [2024-11-27 23:18:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 707 transitions. [2024-11-27 23:18:37,045 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 707 transitions. Word has length 103 [2024-11-27 23:18:37,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:18:37,045 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 707 transitions. [2024-11-27 23:18:37,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 3.857142857142857) internal successors, (135), 37 states have internal predecessors, (135), 14 states have call successors, (25), 3 states have call predecessors, (25), 9 states have return successors, (25), 12 states have call predecessors, (25), 14 states have call successors, (25) [2024-11-27 23:18:37,046 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 707 transitions. [2024-11-27 23:18:37,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-27 23:18:37,048 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:18:37,049 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:18:37,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-27 23:18:37,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:18:37,250 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:18:37,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:18:37,251 INFO L85 PathProgramCache]: Analyzing trace with hash -2107551721, now seen corresponding path program 1 times [2024-11-27 23:18:37,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:18:37,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875756968] [2024-11-27 23:18:37,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:18:37,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:18:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:18:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-27 23:18:37,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:18:37,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875756968] [2024-11-27 23:18:37,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875756968] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:18:37,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853494144] [2024-11-27 23:18:37,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:18:37,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:18:37,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:18:37,558 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:18:37,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-27 23:18:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:18:37,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-27 23:18:37,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:18:37,971 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-27 23:18:37,971 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:18:37,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853494144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:18:37,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 23:18:37,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2024-11-27 23:18:37,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986422167] [2024-11-27 23:18:37,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:18:37,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 23:18:37,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:18:37,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 23:18:37,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-27 23:18:37,973 INFO L87 Difference]: Start difference. First operand 565 states and 707 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-27 23:18:38,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:18:38,237 INFO L93 Difference]: Finished difference Result 1094 states and 1355 transitions. [2024-11-27 23:18:38,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 23:18:38,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 103 [2024-11-27 23:18:38,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:18:38,241 INFO L225 Difference]: With dead ends: 1094 [2024-11-27 23:18:38,241 INFO L226 Difference]: Without dead ends: 448 [2024-11-27 23:18:38,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-11-27 23:18:38,243 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 96 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:18:38,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 344 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:18:38,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-27 23:18:38,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2024-11-27 23:18:38,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 342 states have (on average 1.1695906432748537) internal successors, (400), 355 states have internal predecessors, (400), 64 states have call successors, (64), 31 states have call predecessors, (64), 41 states have return successors, (83), 61 states have call predecessors, (83), 59 states have call successors, (83) [2024-11-27 23:18:38,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 547 transitions. [2024-11-27 23:18:38,365 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 547 transitions. Word has length 103 [2024-11-27 23:18:38,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:18:38,366 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 547 transitions. [2024-11-27 23:18:38,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-27 23:18:38,366 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 547 transitions. [2024-11-27 23:18:38,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-27 23:18:38,367 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:18:38,368 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:18:38,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-27 23:18:38,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:18:38,568 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:18:38,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:18:38,569 INFO L85 PathProgramCache]: Analyzing trace with hash -886785122, now seen corresponding path program 2 times [2024-11-27 23:18:38,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:18:38,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144184363] [2024-11-27 23:18:38,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:18:38,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:18:38,620 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:18:38,620 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:18:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 12 proven. 43 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-27 23:18:39,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:18:39,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144184363] [2024-11-27 23:18:39,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144184363] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:18:39,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439229101] [2024-11-27 23:18:39,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:18:39,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:18:39,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:18:39,528 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:18:39,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-27 23:18:39,862 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:18:39,862 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:18:39,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-27 23:18:39,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:18:39,919 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-27 23:18:39,921 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-27 23:18:44,098 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_10| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_10| Int)) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_10|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_10|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_10| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_10| Int)) (not (= (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_10|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_10|) 0)))) is different from true [2024-11-27 23:18:44,858 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 57 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-27 23:18:44,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:18:45,518 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 40 proven. 11 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-27 23:18:45,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439229101] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:18:45,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:18:45,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 12] total 32 [2024-11-27 23:18:45,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658314305] [2024-11-27 23:18:45,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:18:45,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-27 23:18:45,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:18:45,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-27 23:18:45,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=838, Unknown=1, NotChecked=58, Total=992 [2024-11-27 23:18:45,520 INFO L87 Difference]: Start difference. First operand 448 states and 547 transitions. Second operand has 32 states, 31 states have (on average 4.161290322580645) internal successors, (129), 31 states have internal predecessors, (129), 12 states have call successors, (24), 4 states have call predecessors, (24), 8 states have return successors, (25), 10 states have call predecessors, (25), 12 states have call successors, (25) [2024-11-27 23:18:49,543 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-27 23:18:53,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:18:57,644 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-27 23:19:12,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:19:12,240 INFO L93 Difference]: Finished difference Result 1035 states and 1297 transitions. [2024-11-27 23:19:12,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-27 23:19:12,245 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.161290322580645) internal successors, (129), 31 states have internal predecessors, (129), 12 states have call successors, (24), 4 states have call predecessors, (24), 8 states have return successors, (25), 10 states have call predecessors, (25), 12 states have call successors, (25) Word has length 114 [2024-11-27 23:19:12,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:19:12,250 INFO L225 Difference]: With dead ends: 1035 [2024-11-27 23:19:12,250 INFO L226 Difference]: Without dead ends: 751 [2024-11-27 23:19:12,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 220 SyntacticMatches, 8 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=408, Invalid=3753, Unknown=3, NotChecked=126, Total=4290 [2024-11-27 23:19:12,255 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 219 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 106 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 239 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2024-11-27 23:19:12,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1280 Invalid, 1819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1471 Invalid, 3 Unknown, 239 Unchecked, 13.3s Time] [2024-11-27 23:19:12,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2024-11-27 23:19:12,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 650. [2024-11-27 23:19:12,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 498 states have (on average 1.1726907630522088) internal successors, (584), 518 states have internal predecessors, (584), 86 states have call successors, (86), 45 states have call predecessors, (86), 65 states have return successors, (129), 86 states have call predecessors, (129), 81 states have call successors, (129) [2024-11-27 23:19:12,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 799 transitions. [2024-11-27 23:19:12,441 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 799 transitions. Word has length 114 [2024-11-27 23:19:12,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:19:12,441 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 799 transitions. [2024-11-27 23:19:12,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.161290322580645) internal successors, (129), 31 states have internal predecessors, (129), 12 states have call successors, (24), 4 states have call predecessors, (24), 8 states have return successors, (25), 10 states have call predecessors, (25), 12 states have call successors, (25) [2024-11-27 23:19:12,442 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 799 transitions. [2024-11-27 23:19:12,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-27 23:19:12,444 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:19:12,444 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:12,454 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-27 23:19:12,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-27 23:19:12,645 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:19:12,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:12,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1687537673, now seen corresponding path program 1 times [2024-11-27 23:19:12,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:19:12,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758010994] [2024-11-27 23:19:12,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:12,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:19:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:13,172 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-27 23:19:13,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:19:13,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758010994] [2024-11-27 23:19:13,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758010994] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:19:13,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677186585] [2024-11-27 23:19:13,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:13,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:19:13,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:19:13,175 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:19:13,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-27 23:19:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:13,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-27 23:19:13,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:19:13,609 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-27 23:19:13,611 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-27 23:19:14,153 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 104 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-27 23:19:14,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:19:14,617 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-27 23:19:14,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677186585] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:19:14,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:19:14,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 10] total 30 [2024-11-27 23:19:14,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774994622] [2024-11-27 23:19:14,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:19:14,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-27 23:19:14,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:19:14,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-27 23:19:14,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2024-11-27 23:19:14,619 INFO L87 Difference]: Start difference. First operand 650 states and 799 transitions. Second operand has 30 states, 29 states have (on average 4.448275862068965) internal successors, (129), 27 states have internal predecessors, (129), 9 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (24), 6 states have call predecessors, (24), 9 states have call successors, (24) [2024-11-27 23:19:16,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:19:16,784 INFO L93 Difference]: Finished difference Result 1914 states and 2463 transitions. [2024-11-27 23:19:16,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-27 23:19:16,784 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.448275862068965) internal successors, (129), 27 states have internal predecessors, (129), 9 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (24), 6 states have call predecessors, (24), 9 states have call successors, (24) Word has length 121 [2024-11-27 23:19:16,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:19:16,792 INFO L225 Difference]: With dead ends: 1914 [2024-11-27 23:19:16,792 INFO L226 Difference]: Without dead ends: 1277 [2024-11-27 23:19:16,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=286, Invalid=2794, Unknown=0, NotChecked=0, Total=3080 [2024-11-27 23:19:16,794 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 144 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:19:16,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1519 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-27 23:19:16,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2024-11-27 23:19:17,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1059. [2024-11-27 23:19:17,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 820 states have (on average 1.1780487804878048) internal successors, (966), 852 states have internal predecessors, (966), 129 states have call successors, (129), 68 states have call predecessors, (129), 109 states have return successors, (219), 138 states have call predecessors, (219), 121 states have call successors, (219) [2024-11-27 23:19:17,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1314 transitions. [2024-11-27 23:19:17,030 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1314 transitions. Word has length 121 [2024-11-27 23:19:17,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:19:17,031 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1314 transitions. [2024-11-27 23:19:17,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.448275862068965) internal successors, (129), 27 states have internal predecessors, (129), 9 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (24), 6 states have call predecessors, (24), 9 states have call successors, (24) [2024-11-27 23:19:17,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1314 transitions. [2024-11-27 23:19:17,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-27 23:19:17,034 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:19:17,034 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:17,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-27 23:19:17,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-27 23:19:17,235 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:19:17,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:17,235 INFO L85 PathProgramCache]: Analyzing trace with hash -169666615, now seen corresponding path program 1 times [2024-11-27 23:19:17,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:19:17,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059769247] [2024-11-27 23:19:17,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:17,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:19:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:17,517 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-27 23:19:17,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:19:17,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059769247] [2024-11-27 23:19:17,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059769247] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:19:17,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120122218] [2024-11-27 23:19:17,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:17,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:19:17,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:19:17,521 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:19:17,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-27 23:19:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:17,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-27 23:19:17,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:19:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-27 23:19:18,024 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:19:18,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120122218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:18,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 23:19:18,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2024-11-27 23:19:18,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111163064] [2024-11-27 23:19:18,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:18,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 23:19:18,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:19:18,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 23:19:18,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-11-27 23:19:18,025 INFO L87 Difference]: Start difference. First operand 1059 states and 1314 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-27 23:19:18,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:19:18,561 INFO L93 Difference]: Finished difference Result 2243 states and 2868 transitions. [2024-11-27 23:19:18,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 23:19:18,561 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 121 [2024-11-27 23:19:18,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:19:18,568 INFO L225 Difference]: With dead ends: 2243 [2024-11-27 23:19:18,568 INFO L226 Difference]: Without dead ends: 1147 [2024-11-27 23:19:18,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2024-11-27 23:19:18,571 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 101 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:19:18,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 389 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:19:18,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2024-11-27 23:19:18,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 884. [2024-11-27 23:19:18,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 695 states have (on average 1.2143884892086332) internal successors, (844), 728 states have internal predecessors, (844), 92 states have call successors, (92), 48 states have call predecessors, (92), 96 states have return successors, (202), 107 states have call predecessors, (202), 86 states have call successors, (202) [2024-11-27 23:19:18,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1138 transitions. [2024-11-27 23:19:18,800 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1138 transitions. Word has length 121 [2024-11-27 23:19:18,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:19:18,800 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 1138 transitions. [2024-11-27 23:19:18,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-27 23:19:18,800 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1138 transitions. [2024-11-27 23:19:18,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-27 23:19:18,802 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:19:18,802 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:18,813 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-11-27 23:19:19,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:19:19,003 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:19:19,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:19,004 INFO L85 PathProgramCache]: Analyzing trace with hash 381192238, now seen corresponding path program 1 times [2024-11-27 23:19:19,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:19:19,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007333718] [2024-11-27 23:19:19,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:19,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:19:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:19,380 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-27 23:19:19,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:19:19,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007333718] [2024-11-27 23:19:19,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007333718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:19,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:19,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 23:19:19,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049357579] [2024-11-27 23:19:19,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:19,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 23:19:19,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:19:19,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 23:19:19,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:19:19,381 INFO L87 Difference]: Start difference. First operand 884 states and 1138 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-27 23:19:19,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:19:19,617 INFO L93 Difference]: Finished difference Result 976 states and 1245 transitions. [2024-11-27 23:19:19,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 23:19:19,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 110 [2024-11-27 23:19:19,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:19:19,623 INFO L225 Difference]: With dead ends: 976 [2024-11-27 23:19:19,623 INFO L226 Difference]: Without dead ends: 974 [2024-11-27 23:19:19,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-27 23:19:19,625 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 3 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:19:19,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 434 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:19:19,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-11-27 23:19:19,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 946. [2024-11-27 23:19:19,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 735 states have (on average 1.202721088435374) internal successors, (884), 780 states have internal predecessors, (884), 97 states have call successors, (97), 53 states have call predecessors, (97), 113 states have return successors, (228), 112 states have call predecessors, (228), 91 states have call successors, (228) [2024-11-27 23:19:19,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1209 transitions. [2024-11-27 23:19:19,854 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1209 transitions. Word has length 110 [2024-11-27 23:19:19,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:19:19,854 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1209 transitions. [2024-11-27 23:19:19,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-27 23:19:19,854 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1209 transitions. [2024-11-27 23:19:19,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-27 23:19:19,856 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:19:19,856 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:19,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-27 23:19:19,856 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:19:19,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:19,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1943098471, now seen corresponding path program 2 times [2024-11-27 23:19:19,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:19:19,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199381082] [2024-11-27 23:19:19,857 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:19:19,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:19:19,918 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:19:19,919 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:19:20,312 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-27 23:19:20,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:19:20,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199381082] [2024-11-27 23:19:20,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199381082] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:19:20,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235632123] [2024-11-27 23:19:20,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:19:20,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:19:20,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:19:20,315 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:19:20,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-27 23:19:20,696 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:19:20,696 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:19:20,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 107 conjuncts are in the unsatisfiable core [2024-11-27 23:19:20,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:19:20,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-27 23:19:20,786 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-27 23:19:20,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2024-11-27 23:19:20,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-27 23:19:24,502 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 47 proven. 38 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-27 23:19:24,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:19:26,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:19:26,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 7428 treesize of output 6784 [2024-11-27 23:19:26,996 INFO L349 Elim1Store]: treesize reduction 58, result has 65.1 percent of original size [2024-11-27 23:19:26,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 16527 treesize of output 15259 [2024-11-27 23:19:27,340 INFO L349 Elim1Store]: treesize reduction 51, result has 68.3 percent of original size [2024-11-27 23:19:27,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 2788 treesize of output 2639 [2024-11-27 23:19:27,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:19:27,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2420 treesize of output 2348 [2024-11-27 23:19:34,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:19:34,283 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 41 [2024-11-27 23:19:34,302 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:19:34,308 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-27 23:19:34,309 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2024-11-27 23:19:34,319 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-27 23:19:34,319 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2024-11-27 23:19:34,403 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-27 23:19:34,410 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-27 23:19:34,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-27 23:19:34,625 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 23 proven. 50 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-27 23:19:34,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235632123] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:19:34,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:19:34,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 23, 24] total 50 [2024-11-27 23:19:34,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225147008] [2024-11-27 23:19:34,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:19:34,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-27 23:19:34,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:19:34,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-27 23:19:34,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2260, Unknown=0, NotChecked=0, Total=2450 [2024-11-27 23:19:34,627 INFO L87 Difference]: Start difference. First operand 946 states and 1209 transitions. Second operand has 50 states, 48 states have (on average 3.5) internal successors, (168), 42 states have internal predecessors, (168), 17 states have call successors, (29), 5 states have call predecessors, (29), 10 states have return successors, (27), 15 states have call predecessors, (27), 16 states have call successors, (27) [2024-11-27 23:19:39,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:19:39,633 INFO L93 Difference]: Finished difference Result 1885 states and 2379 transitions. [2024-11-27 23:19:39,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-27 23:19:39,634 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 3.5) internal successors, (168), 42 states have internal predecessors, (168), 17 states have call successors, (29), 5 states have call predecessors, (29), 10 states have return successors, (27), 15 states have call predecessors, (27), 16 states have call successors, (27) Word has length 113 [2024-11-27 23:19:39,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:19:39,637 INFO L225 Difference]: With dead ends: 1885 [2024-11-27 23:19:39,637 INFO L226 Difference]: Without dead ends: 1071 [2024-11-27 23:19:39,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 180 SyntacticMatches, 6 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1684 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=497, Invalid=6309, Unknown=0, NotChecked=0, Total=6806 [2024-11-27 23:19:39,640 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 195 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 1924 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-27 23:19:39,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1607 Invalid, 2013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1924 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-27 23:19:39,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-11-27 23:19:39,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 964. [2024-11-27 23:19:39,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 748 states have (on average 1.1858288770053476) internal successors, (887), 796 states have internal predecessors, (887), 96 states have call successors, (96), 54 states have call predecessors, (96), 119 states have return successors, (229), 113 states have call predecessors, (229), 89 states have call successors, (229) [2024-11-27 23:19:39,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1212 transitions. [2024-11-27 23:19:39,840 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1212 transitions. Word has length 113 [2024-11-27 23:19:39,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:19:39,841 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1212 transitions. [2024-11-27 23:19:39,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 3.5) internal successors, (168), 42 states have internal predecessors, (168), 17 states have call successors, (29), 5 states have call predecessors, (29), 10 states have return successors, (27), 15 states have call predecessors, (27), 16 states have call successors, (27) [2024-11-27 23:19:39,841 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1212 transitions. [2024-11-27 23:19:39,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-27 23:19:39,843 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:19:39,843 INFO L218 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:39,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-11-27 23:19:40,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:19:40,044 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:19:40,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:40,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1330556572, now seen corresponding path program 1 times [2024-11-27 23:19:40,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:19:40,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554442076] [2024-11-27 23:19:40,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:40,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:19:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 23:19:40,098 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 23:19:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 23:19:40,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 23:19:40,196 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 23:19:40,197 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-27 23:19:40,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-27 23:19:40,202 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:19:40,291 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 23:19:40,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:19:40 BoogieIcfgContainer [2024-11-27 23:19:40,298 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 23:19:40,299 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 23:19:40,299 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 23:19:40,299 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 23:19:40,300 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:15:16" (3/4) ... [2024-11-27 23:19:40,301 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-27 23:19:40,400 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 58. [2024-11-27 23:19:40,504 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-27 23:19:40,508 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-27 23:19:40,508 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 23:19:40,509 INFO L158 Benchmark]: Toolchain (without parser) took 267686.66ms. Allocated memory was 117.4MB in the beginning and 847.2MB in the end (delta: 729.8MB). Free memory was 87.1MB in the beginning and 476.5MB in the end (delta: -389.5MB). Peak memory consumption was 332.5MB. Max. memory is 16.1GB. [2024-11-27 23:19:40,509 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 167.8MB. Free memory is still 104.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:19:40,509 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2791.81ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 87.1MB in the beginning and 290.1MB in the end (delta: -203.1MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. [2024-11-27 23:19:40,509 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.61ms. Allocated memory is still 352.3MB. Free memory was 290.1MB in the beginning and 284.5MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 23:19:40,510 INFO L158 Benchmark]: Boogie Preprocessor took 77.39ms. Allocated memory is still 352.3MB. Free memory was 284.5MB in the beginning and 280.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:19:40,510 INFO L158 Benchmark]: RCFGBuilder took 858.36ms. Allocated memory is still 352.3MB. Free memory was 280.5MB in the beginning and 254.9MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-27 23:19:40,510 INFO L158 Benchmark]: TraceAbstraction took 263630.23ms. Allocated memory was 352.3MB in the beginning and 847.2MB in the end (delta: 494.9MB). Free memory was 254.3MB in the beginning and 489.1MB in the end (delta: -234.8MB). Peak memory consumption was 262.7MB. Max. memory is 16.1GB. [2024-11-27 23:19:40,510 INFO L158 Benchmark]: Witness Printer took 209.42ms. Allocated memory is still 847.2MB. Free memory was 489.1MB in the beginning and 476.5MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 23:19:40,511 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.42ms. Allocated memory is still 167.8MB. Free memory is still 104.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2791.81ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 87.1MB in the beginning and 290.1MB in the end (delta: -203.1MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.61ms. Allocated memory is still 352.3MB. Free memory was 290.1MB in the beginning and 284.5MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.39ms. Allocated memory is still 352.3MB. Free memory was 284.5MB in the beginning and 280.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 858.36ms. Allocated memory is still 352.3MB. Free memory was 280.5MB in the beginning and 254.9MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 263630.23ms. Allocated memory was 352.3MB in the beginning and 847.2MB in the end (delta: 494.9MB). Free memory was 254.3MB in the beginning and 489.1MB in the end (delta: -234.8MB). Peak memory consumption was 262.7MB. Max. memory is 16.1GB. * Witness Printer took 209.42ms. Allocated memory is still 847.2MB. Free memory was 489.1MB in the beginning and 476.5MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 223]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7326] static __thread int tl_last_error = 0; VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7360] CALL aws_linked_list_begin_harness() [L7344] struct aws_linked_list list; [L7346] CALL ensure_linked_list_is_allocated(&list, 20) [L6743] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L266] return __VERIFIER_nondet_ulong(); [L6743] RET, EXPR nondet_uint64_t() VAL [list={7:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6743] size_t length = nondet_uint64_t(); [L6744] CALL assume_abort_if_not(length <= max_length) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6744] RET assume_abort_if_not(length <= max_length) VAL [length=-((__int128) 1 << 64), list={7:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6746-L6747] list->head.prev = ((void *)0) [L6749-L6750] list->tail.next = ((void *)0) [L6753] struct aws_linked_list_node *curr = &list->head; [L6755] size_t i = 0; VAL [curr={7:0}, i=0, length=-((__int128) 1 << 64), list={7:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6755] COND FALSE !(i < length) VAL [curr={7:0}, list={7:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6764] curr->next = &list->tail [L6765] list->tail.prev = curr VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7346] RET ensure_linked_list_is_allocated(&list, 20) [L7349] CALL, EXPR aws_linked_list_is_valid(&list) VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next [L4694] EXPR list->head.next [L4694] EXPR list && list->head.next VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694] EXPR list->head.prev [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4696] EXPR list->tail.prev [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4696] EXPR list->tail.next [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] COND TRUE list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4700] CALL, EXPR aws_linked_list_is_valid_deep(list) [L4734] COND FALSE !(!list) [L4740] const struct aws_linked_list_node *temp = &list->head; [L4743-L4746] _Bool head_reaches_tail = 0 ; VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:16}, tl_last_error=0] [L4751] COND TRUE temp == &list->tail [L4752-L4753] head_reaches_tail = 1 VAL [head_reaches_tail=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4764] return head_reaches_tail; VAL [\result=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4700] RET, EXPR aws_linked_list_is_valid_deep(list) [L4700] return aws_linked_list_is_valid_deep(list); [L7349] RET, EXPR aws_linked_list_is_valid(&list) VAL [list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7349] CALL assume_abort_if_not(aws_linked_list_is_valid(&list)) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7349] RET assume_abort_if_not(aws_linked_list_is_valid(&list)) VAL [list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7354] CALL aws_linked_list_begin(&list) [L4788] CALL, EXPR aws_linked_list_is_valid(list) VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next [L4694] EXPR list->head.next [L4694] EXPR list && list->head.next VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694] EXPR list->head.prev [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4696] EXPR list->tail.prev [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4696] EXPR list->tail.next [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] COND TRUE list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4700] CALL, EXPR aws_linked_list_is_valid_deep(list) [L4734] COND FALSE !(!list) [L4740] const struct aws_linked_list_node *temp = &list->head; [L4743-L4746] _Bool head_reaches_tail = 0 ; VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:16}, tl_last_error=0] [L4751] COND TRUE temp == &list->tail [L4752-L4753] head_reaches_tail = 1 VAL [head_reaches_tail=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4764] return head_reaches_tail; VAL [\result=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4700] RET, EXPR aws_linked_list_is_valid_deep(list) [L4700] return aws_linked_list_is_valid_deep(list); [L4788] RET, EXPR aws_linked_list_is_valid(list) VAL [list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4788] 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] [L4788] RET assume_abort_if_not((aws_linked_list_is_valid(list))) VAL [list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4789] EXPR list->head.next [L4789] struct aws_linked_list_node *rval = list->head.next; [L4790] CALL, EXPR aws_linked_list_is_valid(list) VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next [L4694] EXPR list->head.next [L4694] EXPR list && list->head.next VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694] EXPR list->head.prev [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4696] EXPR list->tail.prev [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4696] EXPR list->tail.next [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] COND TRUE list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4700] CALL, EXPR aws_linked_list_is_valid_deep(list) [L4734] COND FALSE !(!list) [L4740] const struct aws_linked_list_node *temp = &list->head; [L4743-L4746] _Bool head_reaches_tail = 0 ; VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:16}, tl_last_error=0] [L4751] COND TRUE temp == &list->tail [L4752-L4753] head_reaches_tail = 1 VAL [head_reaches_tail=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4764] return head_reaches_tail; VAL [\result=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4700] RET, EXPR aws_linked_list_is_valid_deep(list) [L4700] return aws_linked_list_is_valid_deep(list); [L4790] RET, EXPR aws_linked_list_is_valid(list) VAL [list={7:0}, rval={7:16}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4790] CALL __VERIFIER_assert(!((aws_linked_list_is_valid(list)))) VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L223] COND TRUE !cond VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L223] reach_error() VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 263.5s, OverallIterations: 27, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 94.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 718 mSolverCounterUnknown, 3057 SdHoareTripleChecker+Valid, 51.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2873 mSDsluCounter, 22225 SdHoareTripleChecker+Invalid, 49.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 798 IncrementalHoareTripleChecker+Unchecked, 20033 mSDsCounter, 1008 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17041 IncrementalHoareTripleChecker+Invalid, 19565 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1008 mSolverCounterUnsat, 2192 mSDtfsCounter, 17041 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 718 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3805 GetRequests, 2948 SyntacticMatches, 54 SemanticMatches, 803 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 8115 ImplicationChecksByTransitivity, 144.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1241occurred in iteration=13, InterpolantAutomatonStates: 526, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 1600 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 153.4s InterpolantComputationTime, 4527 NumberOfCodeBlocks, 4437 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 5496 ConstructedInterpolants, 537 QuantifiedInterpolants, 77798 SizeOfPredicates, 135 NumberOfNonLiveVariables, 9187 ConjunctsInSsa, 880 ConjunctsInUnsatCore, 61 InterpolantComputations, 16 PerfectInterpolantSequences, 3120/3785 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-27 23:19:40,661 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9574eb4c-0440-4564-a57b-936d9227b620/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE