./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-sorted-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/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_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-sorted-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:08:12,661 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:08:12,733 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 05:08:12,741 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:08:12,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:08:12,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:08:12,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:08:12,782 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:08:12,782 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:08:12,782 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:08:12,783 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:08:12,783 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:08:12,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:08:12,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:08:12,783 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:08:12,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:08:12,783 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:08:12,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:08:12,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:08:12,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:08:12,784 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 05:08:12,784 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 05:08:12,784 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 05:08:12,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:08:12,784 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 05:08:12,786 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 05:08:12,787 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:08:12,787 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:08:12,787 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:08:12,787 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:08:12,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:08:12,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:08:12,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:08:12,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:08:12,788 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:08:12,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:08:12,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:08:12,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:08:12,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:08:12,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:08:12,789 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:08:12,789 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 05:08:12,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 05:08:12,789 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:08:12,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:08:12,789 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:08:12,789 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:08:12,790 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_314106d6-fb08-4c46-bec3-113c0f14cd17/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 [2024-11-28 05:08:13,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:08:13,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:08:13,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:08:13,104 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:08:13,105 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:08:13,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/forester-heap/dll-sorted-2.i [2024-11-28 05:08:16,170 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/data/3deddcc80/d4a772be68b140cead5904e1ada31c46/FLAGc5459002d [2024-11-28 05:08:16,564 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:08:16,565 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/sv-benchmarks/c/forester-heap/dll-sorted-2.i [2024-11-28 05:08:16,582 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/data/3deddcc80/d4a772be68b140cead5904e1ada31c46/FLAGc5459002d [2024-11-28 05:08:16,751 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/data/3deddcc80/d4a772be68b140cead5904e1ada31c46 [2024-11-28 05:08:16,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:08:16,757 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:08:16,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:08:16,760 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:08:16,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:08:16,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:08:16" (1/1) ... [2024-11-28 05:08:16,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c06bc3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:08:16, skipping insertion in model container [2024-11-28 05:08:16,771 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:08:16" (1/1) ... [2024-11-28 05:08:16,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:08:17,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:08:17,236 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:08:17,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:08:17,339 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:08:17,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:08:17 WrapperNode [2024-11-28 05:08:17,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:08:17,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:08:17,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:08:17,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:08:17,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:08:17" (1/1) ... [2024-11-28 05:08:17,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:08:17" (1/1) ... [2024-11-28 05:08:17,398 INFO L138 Inliner]: procedures = 119, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 187 [2024-11-28 05:08:17,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:08:17,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:08:17,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:08:17,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:08:17,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:08:17" (1/1) ... [2024-11-28 05:08:17,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:08:17" (1/1) ... [2024-11-28 05:08:17,413 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:08:17" (1/1) ... [2024-11-28 05:08:17,439 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2024-11-28 05:08:17,439 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:08:17" (1/1) ... [2024-11-28 05:08:17,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:08:17" (1/1) ... [2024-11-28 05:08:17,449 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:08:17" (1/1) ... [2024-11-28 05:08:17,450 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:08:17" (1/1) ... [2024-11-28 05:08:17,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:08:17" (1/1) ... [2024-11-28 05:08:17,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:08:17" (1/1) ... [2024-11-28 05:08:17,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:08:17" (1/1) ... [2024-11-28 05:08:17,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:08:17,463 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:08:17,463 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:08:17,463 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:08:17,465 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:08:17" (1/1) ... [2024-11-28 05:08:17,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:08:17,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:08:17,498 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:08:17,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:08:17,531 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-28 05:08:17,531 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-28 05:08:17,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 05:08:17,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 05:08:17,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 05:08:17,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 05:08:17,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 05:08:17,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:08:17,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 05:08:17,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 05:08:17,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 05:08:17,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 05:08:17,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 05:08:17,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 05:08:17,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 05:08:17,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:08:17,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:08:17,686 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:08:17,687 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:08:18,276 INFO L? ?]: Removed 162 outVars from TransFormulas that were not future-live. [2024-11-28 05:08:18,276 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:08:18,296 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:08:18,297 INFO L312 CfgBuilder]: Removed 12 assume(true) statements. [2024-11-28 05:08:18,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:08:18 BoogieIcfgContainer [2024-11-28 05:08:18,297 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:08:18,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:08:18,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:08:18,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:08:18,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:08:16" (1/3) ... [2024-11-28 05:08:18,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d523bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:08:18, skipping insertion in model container [2024-11-28 05:08:18,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:08:17" (2/3) ... [2024-11-28 05:08:18,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d523bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:08:18, skipping insertion in model container [2024-11-28 05:08:18,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:08:18" (3/3) ... [2024-11-28 05:08:18,322 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-sorted-2.i [2024-11-28 05:08:18,337 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:08:18,339 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-sorted-2.i that has 2 procedures, 186 locations, 1 initial locations, 12 loop locations, and 75 error locations. [2024-11-28 05:08:18,394 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:08:18,410 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=None, 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;@61668a13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:08:18,410 INFO L334 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2024-11-28 05:08:18,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 186 states, 103 states have (on average 2.087378640776699) internal successors, (215), 178 states have internal predecessors, (215), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 05:08:18,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 05:08:18,421 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:18,421 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 05:08:18,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:08:18,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:18,430 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-28 05:08:18,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:18,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656627076] [2024-11-28 05:08:18,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:18,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:18,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:18,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:18,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656627076] [2024-11-28 05:08:18,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656627076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:08:18,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:08:18,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:08:18,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062080836] [2024-11-28 05:08:18,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:08:18,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:08:18,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:18,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:08:18,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:08:18,694 INFO L87 Difference]: Start difference. First operand has 186 states, 103 states have (on average 2.087378640776699) internal successors, (215), 178 states have internal predecessors, (215), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:18,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:18,947 INFO L93 Difference]: Finished difference Result 175 states and 191 transitions. [2024-11-28 05:08:18,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:08:18,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 05:08:18,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:18,959 INFO L225 Difference]: With dead ends: 175 [2024-11-28 05:08:18,959 INFO L226 Difference]: Without dead ends: 173 [2024-11-28 05:08:18,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:08:18,966 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 158 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:18,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 127 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:08:18,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-28 05:08:19,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-11-28 05:08:19,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 95 states have (on average 1.9263157894736842) internal successors, (183), 171 states have internal predecessors, (183), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:19,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 189 transitions. [2024-11-28 05:08:19,024 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 189 transitions. Word has length 3 [2024-11-28 05:08:19,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:19,025 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 189 transitions. [2024-11-28 05:08:19,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:19,025 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 189 transitions. [2024-11-28 05:08:19,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 05:08:19,025 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:19,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 05:08:19,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 05:08:19,026 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:08:19,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:19,026 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-28 05:08:19,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:19,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391008404] [2024-11-28 05:08:19,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:19,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:19,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:19,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391008404] [2024-11-28 05:08:19,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391008404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:08:19,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:08:19,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:08:19,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306062920] [2024-11-28 05:08:19,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:08:19,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:08:19,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:19,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:08:19,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:08:19,158 INFO L87 Difference]: Start difference. First operand 173 states and 189 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:19,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:19,334 INFO L93 Difference]: Finished difference Result 170 states and 186 transitions. [2024-11-28 05:08:19,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:08:19,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 05:08:19,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:19,337 INFO L225 Difference]: With dead ends: 170 [2024-11-28 05:08:19,340 INFO L226 Difference]: Without dead ends: 170 [2024-11-28 05:08:19,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:08:19,341 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 158 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:19,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 123 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:08:19,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-28 05:08:19,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2024-11-28 05:08:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 95 states have (on average 1.894736842105263) internal successors, (180), 168 states have internal predecessors, (180), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:19,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 186 transitions. [2024-11-28 05:08:19,359 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 186 transitions. Word has length 3 [2024-11-28 05:08:19,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:19,362 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 186 transitions. [2024-11-28 05:08:19,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:19,363 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 186 transitions. [2024-11-28 05:08:19,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 05:08:19,363 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:19,363 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:08:19,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 05:08:19,364 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:08:19,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:19,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1570703282, now seen corresponding path program 1 times [2024-11-28 05:08:19,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:19,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543408399] [2024-11-28 05:08:19,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:19,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:19,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:19,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:19,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543408399] [2024-11-28 05:08:19,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543408399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:08:19,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:08:19,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:08:19,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279430444] [2024-11-28 05:08:19,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:08:19,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:08:19,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:19,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:08:19,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:08:19,657 INFO L87 Difference]: Start difference. First operand 170 states and 186 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:19,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:19,988 INFO L93 Difference]: Finished difference Result 169 states and 194 transitions. [2024-11-28 05:08:19,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:08:19,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-28 05:08:19,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:19,991 INFO L225 Difference]: With dead ends: 169 [2024-11-28 05:08:19,991 INFO L226 Difference]: Without dead ends: 169 [2024-11-28 05:08:19,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:08:19,992 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 247 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:19,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 96 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:08:19,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-28 05:08:20,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2024-11-28 05:08:20,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 110 states have (on average 1.709090909090909) internal successors, (188), 165 states have internal predecessors, (188), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:20,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 194 transitions. [2024-11-28 05:08:20,013 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 194 transitions. Word has length 10 [2024-11-28 05:08:20,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:20,013 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 194 transitions. [2024-11-28 05:08:20,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:20,013 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 194 transitions. [2024-11-28 05:08:20,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 05:08:20,014 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:20,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:08:20,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 05:08:20,014 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:08:20,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:20,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1570703281, now seen corresponding path program 1 times [2024-11-28 05:08:20,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:20,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134659091] [2024-11-28 05:08:20,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:20,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:20,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:20,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134659091] [2024-11-28 05:08:20,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134659091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:08:20,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:08:20,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:08:20,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148630111] [2024-11-28 05:08:20,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:08:20,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:08:20,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:20,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:08:20,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:08:20,353 INFO L87 Difference]: Start difference. First operand 167 states and 194 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:20,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:20,785 INFO L93 Difference]: Finished difference Result 240 states and 275 transitions. [2024-11-28 05:08:20,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:08:20,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-28 05:08:20,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:20,788 INFO L225 Difference]: With dead ends: 240 [2024-11-28 05:08:20,788 INFO L226 Difference]: Without dead ends: 240 [2024-11-28 05:08:20,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:08:20,789 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 381 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:20,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 140 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 05:08:20,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-28 05:08:20,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 221. [2024-11-28 05:08:20,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 164 states have (on average 1.6097560975609757) internal successors, (264), 219 states have internal predecessors, (264), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:20,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 270 transitions. [2024-11-28 05:08:20,801 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 270 transitions. Word has length 10 [2024-11-28 05:08:20,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:20,801 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 270 transitions. [2024-11-28 05:08:20,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:20,801 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 270 transitions. [2024-11-28 05:08:20,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-28 05:08:20,802 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:20,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:08:20,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 05:08:20,802 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:08:20,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:20,803 INFO L85 PathProgramCache]: Analyzing trace with hash 944043464, now seen corresponding path program 1 times [2024-11-28 05:08:20,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:20,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555137195] [2024-11-28 05:08:20,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:20,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:20,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:20,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:20,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555137195] [2024-11-28 05:08:20,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555137195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:08:20,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:08:20,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:08:20,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339972969] [2024-11-28 05:08:20,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:08:20,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:08:20,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:20,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:08:20,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:08:20,840 INFO L87 Difference]: Start difference. First operand 221 states and 270 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:20,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:20,867 INFO L93 Difference]: Finished difference Result 270 states and 322 transitions. [2024-11-28 05:08:20,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:08:20,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-28 05:08:20,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:20,869 INFO L225 Difference]: With dead ends: 270 [2024-11-28 05:08:20,869 INFO L226 Difference]: Without dead ends: 270 [2024-11-28 05:08:20,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:08:20,870 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 58 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:20,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 343 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:08:20,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-28 05:08:20,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 235. [2024-11-28 05:08:20,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 178 states have (on average 1.601123595505618) internal successors, (285), 233 states have internal predecessors, (285), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:20,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 291 transitions. [2024-11-28 05:08:20,881 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 291 transitions. Word has length 13 [2024-11-28 05:08:20,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:20,881 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 291 transitions. [2024-11-28 05:08:20,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:20,882 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 291 transitions. [2024-11-28 05:08:20,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-28 05:08:20,882 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:20,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:08:20,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 05:08:20,882 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:08:20,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:20,883 INFO L85 PathProgramCache]: Analyzing trace with hash 847221851, now seen corresponding path program 1 times [2024-11-28 05:08:20,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:20,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648323126] [2024-11-28 05:08:20,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:20,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:21,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:21,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:21,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648323126] [2024-11-28 05:08:21,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648323126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:08:21,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:08:21,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:08:21,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485756223] [2024-11-28 05:08:21,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:08:21,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:08:21,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:21,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:08:21,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:08:21,044 INFO L87 Difference]: Start difference. First operand 235 states and 291 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:21,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:21,291 INFO L93 Difference]: Finished difference Result 234 states and 288 transitions. [2024-11-28 05:08:21,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:08:21,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-28 05:08:21,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:21,294 INFO L225 Difference]: With dead ends: 234 [2024-11-28 05:08:21,294 INFO L226 Difference]: Without dead ends: 234 [2024-11-28 05:08:21,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:08:21,296 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 4 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:21,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 441 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:08:21,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-28 05:08:21,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2024-11-28 05:08:21,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 178 states have (on average 1.5842696629213484) internal successors, (282), 232 states have internal predecessors, (282), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:21,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 288 transitions. [2024-11-28 05:08:21,317 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 288 transitions. Word has length 13 [2024-11-28 05:08:21,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:21,317 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 288 transitions. [2024-11-28 05:08:21,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:21,317 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 288 transitions. [2024-11-28 05:08:21,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-28 05:08:21,317 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:21,317 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:08:21,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 05:08:21,318 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:08:21,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:21,318 INFO L85 PathProgramCache]: Analyzing trace with hash 847221852, now seen corresponding path program 1 times [2024-11-28 05:08:21,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:21,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569363102] [2024-11-28 05:08:21,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:21,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:21,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:21,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:21,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569363102] [2024-11-28 05:08:21,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569363102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:08:21,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:08:21,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:08:21,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006370364] [2024-11-28 05:08:21,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:08:21,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:08:21,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:21,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:08:21,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:08:21,593 INFO L87 Difference]: Start difference. First operand 234 states and 288 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:21,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:21,871 INFO L93 Difference]: Finished difference Result 233 states and 285 transitions. [2024-11-28 05:08:21,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:08:21,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-28 05:08:21,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:21,873 INFO L225 Difference]: With dead ends: 233 [2024-11-28 05:08:21,873 INFO L226 Difference]: Without dead ends: 233 [2024-11-28 05:08:21,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:08:21,875 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 2 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:21,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 421 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:08:21,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-28 05:08:21,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-11-28 05:08:21,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 178 states have (on average 1.5674157303370786) internal successors, (279), 231 states have internal predecessors, (279), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:21,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 285 transitions. [2024-11-28 05:08:21,886 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 285 transitions. Word has length 13 [2024-11-28 05:08:21,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:21,886 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 285 transitions. [2024-11-28 05:08:21,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:21,886 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 285 transitions. [2024-11-28 05:08:21,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 05:08:21,887 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:21,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:08:21,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 05:08:21,887 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:08:21,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:21,888 INFO L85 PathProgramCache]: Analyzing trace with hash 94244445, now seen corresponding path program 1 times [2024-11-28 05:08:21,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:21,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069285539] [2024-11-28 05:08:21,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:21,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:22,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:22,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:22,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069285539] [2024-11-28 05:08:22,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069285539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:08:22,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:08:22,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 05:08:22,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353602843] [2024-11-28 05:08:22,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:08:22,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:08:22,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:22,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:08:22,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:08:22,181 INFO L87 Difference]: Start difference. First operand 233 states and 285 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:22,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:22,719 INFO L93 Difference]: Finished difference Result 232 states and 283 transitions. [2024-11-28 05:08:22,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 05:08:22,719 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-28 05:08:22,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:22,720 INFO L225 Difference]: With dead ends: 232 [2024-11-28 05:08:22,721 INFO L226 Difference]: Without dead ends: 232 [2024-11-28 05:08:22,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-28 05:08:22,721 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 239 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:22,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 345 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 05:08:22,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-28 05:08:22,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2024-11-28 05:08:22,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 178 states have (on average 1.5561797752808988) internal successors, (277), 230 states have internal predecessors, (277), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 283 transitions. [2024-11-28 05:08:22,731 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 283 transitions. Word has length 17 [2024-11-28 05:08:22,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:22,732 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 283 transitions. [2024-11-28 05:08:22,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:22,732 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 283 transitions. [2024-11-28 05:08:22,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 05:08:22,733 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:22,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:08:22,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 05:08:22,734 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:08:22,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:22,735 INFO L85 PathProgramCache]: Analyzing trace with hash 94244446, now seen corresponding path program 1 times [2024-11-28 05:08:22,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:22,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16747148] [2024-11-28 05:08:22,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:22,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:23,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:23,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:23,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16747148] [2024-11-28 05:08:23,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16747148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:08:23,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:08:23,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 05:08:23,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599471703] [2024-11-28 05:08:23,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:08:23,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 05:08:23,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:23,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 05:08:23,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:08:23,182 INFO L87 Difference]: Start difference. First operand 232 states and 283 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:24,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:24,026 INFO L93 Difference]: Finished difference Result 226 states and 273 transitions. [2024-11-28 05:08:24,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 05:08:24,027 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-28 05:08:24,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:24,028 INFO L225 Difference]: With dead ends: 226 [2024-11-28 05:08:24,028 INFO L226 Difference]: Without dead ends: 226 [2024-11-28 05:08:24,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-11-28 05:08:24,029 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 248 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:24,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 482 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 05:08:24,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-28 05:08:24,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 217. [2024-11-28 05:08:24,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 169 states have (on average 1.5266272189349113) internal successors, (258), 215 states have internal predecessors, (258), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:24,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 264 transitions. [2024-11-28 05:08:24,035 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 264 transitions. Word has length 17 [2024-11-28 05:08:24,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:24,036 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 264 transitions. [2024-11-28 05:08:24,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:24,036 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 264 transitions. [2024-11-28 05:08:24,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 05:08:24,037 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:24,037 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-28 05:08:24,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 05:08:24,037 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:08:24,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:24,038 INFO L85 PathProgramCache]: Analyzing trace with hash 2048861905, now seen corresponding path program 1 times [2024-11-28 05:08:24,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:24,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589074261] [2024-11-28 05:08:24,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:24,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:24,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:08:24,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:24,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589074261] [2024-11-28 05:08:24,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589074261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:08:24,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:08:24,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:08:24,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693453529] [2024-11-28 05:08:24,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:08:24,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:08:24,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:24,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:08:24,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:08:24,138 INFO L87 Difference]: Start difference. First operand 217 states and 264 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:24,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:24,301 INFO L93 Difference]: Finished difference Result 241 states and 273 transitions. [2024-11-28 05:08:24,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:08:24,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-28 05:08:24,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:24,303 INFO L225 Difference]: With dead ends: 241 [2024-11-28 05:08:24,303 INFO L226 Difference]: Without dead ends: 241 [2024-11-28 05:08:24,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:08:24,304 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 267 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:24,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 215 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:08:24,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-28 05:08:24,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 216. [2024-11-28 05:08:24,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 169 states have (on average 1.5088757396449703) internal successors, (255), 214 states have internal predecessors, (255), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:24,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 260 transitions. [2024-11-28 05:08:24,310 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 260 transitions. Word has length 28 [2024-11-28 05:08:24,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:24,310 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 260 transitions. [2024-11-28 05:08:24,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:24,311 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 260 transitions. [2024-11-28 05:08:24,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 05:08:24,311 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:24,311 INFO L218 NwaCegarLoop]: trace histogram [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-28 05:08:24,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 05:08:24,311 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:08:24,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:24,312 INFO L85 PathProgramCache]: Analyzing trace with hash -952821515, now seen corresponding path program 1 times [2024-11-28 05:08:24,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:24,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989814232] [2024-11-28 05:08:24,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:24,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:24,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:24,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:24,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989814232] [2024-11-28 05:08:24,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989814232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:08:24,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973942865] [2024-11-28 05:08:24,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:24,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:08:24,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:08:24,942 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:08:24,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 05:08:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:25,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-28 05:08:25,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:08:25,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:08:25,258 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 05:08:25,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 05:08:25,340 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 15 treesize of output 1 [2024-11-28 05:08:25,501 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:08:25,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-28 05:08:25,662 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 05:08:25,662 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 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-28 05:08:25,744 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:08:25,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-28 05:08:25,980 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 25 treesize of output 13 [2024-11-28 05:08:26,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:26,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:08:26,528 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_74| Int) (v_ArrVal_334 (Array Int Int))) (or (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_334))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_336)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_74|)) 1) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_74|) (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0))) is different from false [2024-11-28 05:08:26,552 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_74| Int) (v_ArrVal_334 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_74|) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_334))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_336)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_74|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0))) is different from false [2024-11-28 05:08:26,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:08:26,584 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 38 treesize of output 31 [2024-11-28 05:08:26,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:08:26,598 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 144 treesize of output 131 [2024-11-28 05:08:26,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:08:26,621 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 80 treesize of output 78 [2024-11-28 05:08:26,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2024-11-28 05:08:31,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:31,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973942865] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:08:31,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:08:31,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 33 [2024-11-28 05:08:31,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176020914] [2024-11-28 05:08:31,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:08:31,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-28 05:08:31,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:31,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-28 05:08:31,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=839, Unknown=9, NotChecked=122, Total=1122 [2024-11-28 05:08:31,845 INFO L87 Difference]: Start difference. First operand 216 states and 260 transitions. Second operand has 34 states, 33 states have (on average 2.727272727272727) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:34,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:34,034 INFO L93 Difference]: Finished difference Result 327 states and 371 transitions. [2024-11-28 05:08:34,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 05:08:34,034 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.727272727272727) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-28 05:08:34,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:34,037 INFO L225 Difference]: With dead ends: 327 [2024-11-28 05:08:34,037 INFO L226 Difference]: Without dead ends: 327 [2024-11-28 05:08:34,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=261, Invalid=1220, Unknown=9, NotChecked=150, Total=1640 [2024-11-28 05:08:34,038 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 994 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 2405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 661 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:34,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 1357 Invalid, 2405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1675 Invalid, 0 Unknown, 661 Unchecked, 1.8s Time] [2024-11-28 05:08:34,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-28 05:08:34,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 242. [2024-11-28 05:08:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 195 states have (on average 1.4666666666666666) internal successors, (286), 240 states have internal predecessors, (286), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:34,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 291 transitions. [2024-11-28 05:08:34,048 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 291 transitions. Word has length 32 [2024-11-28 05:08:34,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:34,048 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 291 transitions. [2024-11-28 05:08:34,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.727272727272727) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:34,048 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 291 transitions. [2024-11-28 05:08:34,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 05:08:34,049 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:34,050 INFO L218 NwaCegarLoop]: trace histogram [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-28 05:08:34,060 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 05:08:34,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:08:34,254 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:08:34,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:34,255 INFO L85 PathProgramCache]: Analyzing trace with hash -952821514, now seen corresponding path program 1 times [2024-11-28 05:08:34,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:34,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486233001] [2024-11-28 05:08:34,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:34,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:34,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:34,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:34,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486233001] [2024-11-28 05:08:34,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486233001] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:08:34,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743508658] [2024-11-28 05:08:34,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:34,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:08:34,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:08:34,994 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:08:34,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 05:08:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:35,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-28 05:08:35,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:08:35,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:08:35,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 05:08:35,244 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:08:35,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 05:08:35,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:08:35,307 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 15 treesize of output 1 [2024-11-28 05:08:35,438 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:08:35,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-28 05:08:35,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 05:08:35,585 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 05:08:35,585 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-28 05:08:35,605 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 05:08:35,605 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 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-28 05:08:35,709 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:08:35,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-28 05:08:35,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 05:08:35,933 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 25 treesize of output 13 [2024-11-28 05:08:35,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 05:08:35,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:35,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:08:36,317 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_438 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_79| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_79| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_79|) (< 0 (+ 9 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|))))) (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_79| Int)) (or (< (+ 11 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_437) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|))) (< |v_ULTIMATE.start_main_~x~0#1.offset_79| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_79|)))) is different from false [2024-11-28 05:08:36,449 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_79| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_79| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_79|) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|) 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_437) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|))))) (forall ((v_ArrVal_438 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_79| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_79| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_79|) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|) 9))))) is different from false [2024-11-28 05:08:36,658 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_79| Int) (v_ArrVal_433 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_79| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_79|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_433) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|) 9)))) (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_79| Int) (v_ArrVal_433 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_79| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_79|) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_434))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_433) .cse0 v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|) 11) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_437) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|)))))))) is different from false [2024-11-28 05:08:36,695 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_79| Int) (v_ArrVal_433 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_79| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_79|) (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_433) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_434) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|))))) (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_79| Int) (v_ArrVal_433 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_79| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_79|) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_434))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_433) .cse1 v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|) 11) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_437) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|))))))))) is different from false [2024-11-28 05:08:36,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:08:36,763 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 73 treesize of output 74 [2024-11-28 05:08:36,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:08:36,774 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 65 treesize of output 50 [2024-11-28 05:08:36,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:08:36,795 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 632 treesize of output 567 [2024-11-28 05:08:36,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:08:36,846 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 1831 treesize of output 1742 [2024-11-28 05:08:36,916 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 547 treesize of output 523 [2024-11-28 05:08:36,940 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 523 treesize of output 499 [2024-11-28 05:08:36,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:08:36,974 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 499 treesize of output 455 [2024-11-28 05:08:36,992 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 447 treesize of output 439 [2024-11-28 05:08:38,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:08:38,002 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 38 treesize of output 39 [2024-11-28 05:08:38,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:08:38,013 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 30 treesize of output 31 [2024-11-28 05:08:38,017 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:08:38,020 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 28 treesize of output 20 [2024-11-28 05:08:38,025 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:08:38,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:08:38,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:08:38,030 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-28 05:08:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:38,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743508658] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:08:38,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:08:38,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 35 [2024-11-28 05:08:38,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747637275] [2024-11-28 05:08:38,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:08:38,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-28 05:08:38,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:38,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-28 05:08:38,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=880, Unknown=7, NotChecked=252, Total=1260 [2024-11-28 05:08:38,354 INFO L87 Difference]: Start difference. First operand 242 states and 291 transitions. Second operand has 36 states, 35 states have (on average 2.6857142857142855) internal successors, (94), 36 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:41,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:41,021 INFO L93 Difference]: Finished difference Result 318 states and 362 transitions. [2024-11-28 05:08:41,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 05:08:41,022 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.6857142857142855) internal successors, (94), 36 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-28 05:08:41,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:41,023 INFO L225 Difference]: With dead ends: 318 [2024-11-28 05:08:41,023 INFO L226 Difference]: Without dead ends: 318 [2024-11-28 05:08:41,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=280, Invalid=1451, Unknown=7, NotChecked=332, Total=2070 [2024-11-28 05:08:41,025 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 614 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 2416 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 3717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1255 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:41,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 1644 Invalid, 3717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2416 Invalid, 0 Unknown, 1255 Unchecked, 2.0s Time] [2024-11-28 05:08:41,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-28 05:08:41,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 242. [2024-11-28 05:08:41,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 195 states have (on average 1.4615384615384615) internal successors, (285), 240 states have internal predecessors, (285), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:41,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 290 transitions. [2024-11-28 05:08:41,033 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 290 transitions. Word has length 32 [2024-11-28 05:08:41,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:41,033 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 290 transitions. [2024-11-28 05:08:41,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.6857142857142855) internal successors, (94), 36 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:41,034 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 290 transitions. [2024-11-28 05:08:41,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-28 05:08:41,034 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:41,035 INFO L218 NwaCegarLoop]: trace histogram [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-28 05:08:41,053 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 05:08:41,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:08:41,235 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:08:41,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:41,236 INFO L85 PathProgramCache]: Analyzing trace with hash -824757211, now seen corresponding path program 1 times [2024-11-28 05:08:41,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:41,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438925074] [2024-11-28 05:08:41,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:41,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:41,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:08:41,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:41,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438925074] [2024-11-28 05:08:41,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438925074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:08:41,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:08:41,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:08:41,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905011425] [2024-11-28 05:08:41,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:08:41,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:08:41,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:41,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:08:41,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:08:41,283 INFO L87 Difference]: Start difference. First operand 242 states and 290 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:41,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:41,294 INFO L93 Difference]: Finished difference Result 244 states and 292 transitions. [2024-11-28 05:08:41,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:08:41,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-28 05:08:41,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:41,296 INFO L225 Difference]: With dead ends: 244 [2024-11-28 05:08:41,296 INFO L226 Difference]: Without dead ends: 244 [2024-11-28 05:08:41,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:08:41,297 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:41,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:08:41,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-28 05:08:41,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2024-11-28 05:08:41,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 197 states have (on average 1.4568527918781726) internal successors, (287), 242 states have internal predecessors, (287), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:41,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 292 transitions. [2024-11-28 05:08:41,308 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 292 transitions. Word has length 34 [2024-11-28 05:08:41,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:41,310 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 292 transitions. [2024-11-28 05:08:41,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:41,311 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 292 transitions. [2024-11-28 05:08:41,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 05:08:41,311 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:41,312 INFO L218 NwaCegarLoop]: trace histogram [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-28 05:08:41,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 05:08:41,312 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:08:41,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:41,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1086912086, now seen corresponding path program 1 times [2024-11-28 05:08:41,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:41,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274933727] [2024-11-28 05:08:41,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:41,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:41,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:08:41,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:41,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274933727] [2024-11-28 05:08:41,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274933727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:08:41,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:08:41,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 05:08:41,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861075857] [2024-11-28 05:08:41,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:08:41,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:08:41,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:41,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:08:41,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:08:41,485 INFO L87 Difference]: Start difference. First operand 244 states and 292 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:41,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:41,750 INFO L93 Difference]: Finished difference Result 260 states and 311 transitions. [2024-11-28 05:08:41,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:08:41,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-28 05:08:41,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:41,752 INFO L225 Difference]: With dead ends: 260 [2024-11-28 05:08:41,752 INFO L226 Difference]: Without dead ends: 260 [2024-11-28 05:08:41,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:08:41,753 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 17 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:41,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 656 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:08:41,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-28 05:08:41,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 252. [2024-11-28 05:08:41,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 205 states have (on average 1.4439024390243902) internal successors, (296), 250 states have internal predecessors, (296), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:41,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 301 transitions. [2024-11-28 05:08:41,760 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 301 transitions. Word has length 37 [2024-11-28 05:08:41,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:41,760 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 301 transitions. [2024-11-28 05:08:41,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:41,761 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 301 transitions. [2024-11-28 05:08:41,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 05:08:41,761 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:41,762 INFO L218 NwaCegarLoop]: trace histogram [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-28 05:08:41,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 05:08:41,762 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:08:41,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:41,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1086852504, now seen corresponding path program 1 times [2024-11-28 05:08:41,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:41,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766249415] [2024-11-28 05:08:41,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:41,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:41,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:08:41,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:41,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766249415] [2024-11-28 05:08:41,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766249415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:08:41,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:08:41,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:08:41,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551096795] [2024-11-28 05:08:41,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:08:41,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:08:41,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:41,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:08:41,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:08:41,841 INFO L87 Difference]: Start difference. First operand 252 states and 301 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:41,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:41,934 INFO L93 Difference]: Finished difference Result 248 states and 293 transitions. [2024-11-28 05:08:41,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:08:41,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-28 05:08:41,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:41,936 INFO L225 Difference]: With dead ends: 248 [2024-11-28 05:08:41,936 INFO L226 Difference]: Without dead ends: 248 [2024-11-28 05:08:41,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:08:41,937 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 19 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:41,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 227 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:08:41,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-28 05:08:41,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2024-11-28 05:08:41,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 205 states have (on average 1.4048780487804877) internal successors, (288), 246 states have internal predecessors, (288), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:41,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 293 transitions. [2024-11-28 05:08:41,946 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 293 transitions. Word has length 37 [2024-11-28 05:08:41,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:41,946 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 293 transitions. [2024-11-28 05:08:41,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:41,946 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 293 transitions. [2024-11-28 05:08:41,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 05:08:41,947 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:41,947 INFO L218 NwaCegarLoop]: trace histogram [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-28 05:08:41,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 05:08:41,947 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:08:41,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:41,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1086852503, now seen corresponding path program 1 times [2024-11-28 05:08:41,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:41,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343753062] [2024-11-28 05:08:41,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:41,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:08:42,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:42,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343753062] [2024-11-28 05:08:42,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343753062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:08:42,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:08:42,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:08:42,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389775220] [2024-11-28 05:08:42,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:08:42,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:08:42,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:42,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:08:42,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:08:42,050 INFO L87 Difference]: Start difference. First operand 248 states and 293 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:42,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:42,154 INFO L93 Difference]: Finished difference Result 244 states and 285 transitions. [2024-11-28 05:08:42,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:08:42,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-28 05:08:42,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:42,156 INFO L225 Difference]: With dead ends: 244 [2024-11-28 05:08:42,156 INFO L226 Difference]: Without dead ends: 244 [2024-11-28 05:08:42,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:08:42,157 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 19 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:42,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 217 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:08:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-28 05:08:42,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2024-11-28 05:08:42,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 205 states have (on average 1.3658536585365855) internal successors, (280), 242 states have internal predecessors, (280), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:42,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 285 transitions. [2024-11-28 05:08:42,163 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 285 transitions. Word has length 37 [2024-11-28 05:08:42,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:42,163 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 285 transitions. [2024-11-28 05:08:42,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:42,164 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 285 transitions. [2024-11-28 05:08:42,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 05:08:42,164 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:42,164 INFO L218 NwaCegarLoop]: trace histogram [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-28 05:08:42,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 05:08:42,164 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:08:42,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:42,165 INFO L85 PathProgramCache]: Analyzing trace with hash 216765830, now seen corresponding path program 1 times [2024-11-28 05:08:42,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:42,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263614232] [2024-11-28 05:08:42,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:42,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:42,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:08:42,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:42,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263614232] [2024-11-28 05:08:42,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263614232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:08:42,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:08:42,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:08:42,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098658530] [2024-11-28 05:08:42,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:08:42,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:08:42,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:42,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:08:42,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:08:42,270 INFO L87 Difference]: Start difference. First operand 244 states and 285 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:42,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:42,591 INFO L93 Difference]: Finished difference Result 258 states and 304 transitions. [2024-11-28 05:08:42,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:08:42,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-28 05:08:42,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:42,593 INFO L225 Difference]: With dead ends: 258 [2024-11-28 05:08:42,593 INFO L226 Difference]: Without dead ends: 258 [2024-11-28 05:08:42,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:08:42,593 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 76 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:42,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 345 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:08:42,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-28 05:08:42,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 243. [2024-11-28 05:08:42,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 205 states have (on average 1.3609756097560977) internal successors, (279), 241 states have internal predecessors, (279), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:42,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 284 transitions. [2024-11-28 05:08:42,600 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 284 transitions. Word has length 37 [2024-11-28 05:08:42,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:42,601 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 284 transitions. [2024-11-28 05:08:42,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:42,601 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 284 transitions. [2024-11-28 05:08:42,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 05:08:42,601 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:42,601 INFO L218 NwaCegarLoop]: trace histogram [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-28 05:08:42,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 05:08:42,602 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:08:42,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:42,602 INFO L85 PathProgramCache]: Analyzing trace with hash 216765831, now seen corresponding path program 1 times [2024-11-28 05:08:42,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:42,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971143409] [2024-11-28 05:08:42,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:42,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:43,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:43,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:43,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971143409] [2024-11-28 05:08:43,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971143409] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:08:43,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462897306] [2024-11-28 05:08:43,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:43,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:08:43,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:08:43,270 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:08:43,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 05:08:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:43,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-28 05:08:43,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:08:43,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:08:43,501 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:08:43,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 05:08:43,549 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 15 treesize of output 1 [2024-11-28 05:08:43,556 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 15 treesize of output 1 [2024-11-28 05:08:43,669 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:08:43,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-28 05:08:43,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 05:08:43,707 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 16 treesize of output 8 [2024-11-28 05:08:43,772 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-28 05:08:43,802 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-28 05:08:44,045 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 23 treesize of output 15 [2024-11-28 05:08:44,048 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 26 treesize of output 14 [2024-11-28 05:08:44,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:44,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:08:44,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:08:44,192 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 31 treesize of output 35 [2024-11-28 05:08:44,724 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_771 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_773 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_771) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_770) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_773) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|) 1)))) is different from false [2024-11-28 05:08:44,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:08:44,877 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 38 treesize of output 39 [2024-11-28 05:08:44,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:08:44,886 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 30 treesize of output 31 [2024-11-28 05:08:44,891 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 54 treesize of output 46 [2024-11-28 05:08:44,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:08:44,904 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 100 treesize of output 99 [2024-11-28 05:08:44,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2024-11-28 05:08:44,918 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 76 treesize of output 70 [2024-11-28 05:08:44,925 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 48 treesize of output 46 [2024-11-28 05:08:45,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:45,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462897306] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:08:45,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:08:45,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 42 [2024-11-28 05:08:45,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249357988] [2024-11-28 05:08:45,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:08:45,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-28 05:08:45,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:45,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-28 05:08:45,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1550, Unknown=16, NotChecked=80, Total=1806 [2024-11-28 05:08:45,348 INFO L87 Difference]: Start difference. First operand 243 states and 284 transitions. Second operand has 43 states, 42 states have (on average 2.5476190476190474) internal successors, (107), 43 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:49,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:49,177 INFO L93 Difference]: Finished difference Result 444 states and 510 transitions. [2024-11-28 05:08:49,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-28 05:08:49,178 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.5476190476190474) internal successors, (107), 43 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-28 05:08:49,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:49,180 INFO L225 Difference]: With dead ends: 444 [2024-11-28 05:08:49,180 INFO L226 Difference]: Without dead ends: 444 [2024-11-28 05:08:49,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1838 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1093, Invalid=6727, Unknown=16, NotChecked=174, Total=8010 [2024-11-28 05:08:49,182 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 1744 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 2812 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1744 SdHoareTripleChecker+Valid, 2342 SdHoareTripleChecker+Invalid, 3396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 2812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 423 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:49,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1744 Valid, 2342 Invalid, 3396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 2812 Invalid, 0 Unknown, 423 Unchecked, 2.0s Time] [2024-11-28 05:08:49,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-28 05:08:49,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 270. [2024-11-28 05:08:49,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 239 states have (on average 1.297071129707113) internal successors, (310), 268 states have internal predecessors, (310), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:49,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 315 transitions. [2024-11-28 05:08:49,190 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 315 transitions. Word has length 37 [2024-11-28 05:08:49,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:49,190 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 315 transitions. [2024-11-28 05:08:49,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.5476190476190474) internal successors, (107), 43 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:49,191 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 315 transitions. [2024-11-28 05:08:49,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 05:08:49,191 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:49,191 INFO L218 NwaCegarLoop]: trace histogram [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-28 05:08:49,201 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 05:08:49,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-28 05:08:49,395 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:08:49,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:49,395 INFO L85 PathProgramCache]: Analyzing trace with hash -627390452, now seen corresponding path program 1 times [2024-11-28 05:08:49,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:49,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736741308] [2024-11-28 05:08:49,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:49,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:50,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:50,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:50,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736741308] [2024-11-28 05:08:50,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736741308] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:08:50,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118788830] [2024-11-28 05:08:50,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:50,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:08:50,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:08:50,191 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:08:50,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 05:08:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:50,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-28 05:08:50,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:08:50,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:08:50,446 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:08:50,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 05:08:50,494 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 15 treesize of output 1 [2024-11-28 05:08:50,504 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 15 treesize of output 1 [2024-11-28 05:08:50,647 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:08:50,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-28 05:08:50,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 05:08:50,784 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 05:08:50,785 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 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-28 05:08:50,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:08:50,794 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-28 05:08:50,855 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:08:50,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 59 [2024-11-28 05:08:50,867 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 25 treesize of output 17 [2024-11-28 05:08:50,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 26 [2024-11-28 05:08:51,085 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 33 treesize of output 21 [2024-11-28 05:08:51,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2024-11-28 05:08:51,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:51,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:08:51,687 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 46 treesize of output 26 [2024-11-28 05:08:52,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:08:52,790 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 88 treesize of output 72 [2024-11-28 05:08:52,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:08:52,798 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 64 treesize of output 56 [2024-11-28 05:08:52,803 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 105 treesize of output 93 [2024-11-28 05:08:52,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:08:52,820 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 333 treesize of output 292 [2024-11-28 05:08:52,838 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 137 treesize of output 121 [2024-11-28 05:08:52,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:08:52,857 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 121 treesize of output 117 [2024-11-28 05:08:52,866 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 159 treesize of output 147 [2024-11-28 05:08:53,209 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 05:08:53,500 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:53,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118788830] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:08:53,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:08:53,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 19] total 47 [2024-11-28 05:08:53,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713617789] [2024-11-28 05:08:53,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:08:53,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-28 05:08:53,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:53,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-28 05:08:53,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2013, Unknown=12, NotChecked=0, Total=2162 [2024-11-28 05:08:53,502 INFO L87 Difference]: Start difference. First operand 270 states and 315 transitions. Second operand has 47 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 47 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:56,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:56,709 INFO L93 Difference]: Finished difference Result 320 states and 369 transitions. [2024-11-28 05:08:56,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-28 05:08:56,709 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 47 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-28 05:08:56,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:56,711 INFO L225 Difference]: With dead ends: 320 [2024-11-28 05:08:56,711 INFO L226 Difference]: Without dead ends: 320 [2024-11-28 05:08:56,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=417, Invalid=3993, Unknown=12, NotChecked=0, Total=4422 [2024-11-28 05:08:56,713 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 894 mSDsluCounter, 2313 mSDsCounter, 0 mSdLazyCounter, 2869 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 2407 SdHoareTripleChecker+Invalid, 2927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:56,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 2407 Invalid, 2927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2869 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-28 05:08:56,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-28 05:08:56,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 272. [2024-11-28 05:08:56,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 241 states have (on average 1.2946058091286308) internal successors, (312), 270 states have internal predecessors, (312), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:56,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 317 transitions. [2024-11-28 05:08:56,720 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 317 transitions. Word has length 41 [2024-11-28 05:08:56,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:56,720 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 317 transitions. [2024-11-28 05:08:56,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 47 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:56,720 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 317 transitions. [2024-11-28 05:08:56,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 05:08:56,721 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:56,721 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:08:56,731 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 05:08:56,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:08:56,926 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:08:56,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:56,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1745119182, now seen corresponding path program 1 times [2024-11-28 05:08:56,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:56,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179872180] [2024-11-28 05:08:56,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:56,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:57,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:08:57,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:57,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179872180] [2024-11-28 05:08:57,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179872180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:08:57,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:08:57,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:08:57,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551231407] [2024-11-28 05:08:57,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:08:57,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:08:57,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:57,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:08:57,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:08:57,042 INFO L87 Difference]: Start difference. First operand 272 states and 317 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:57,334 INFO L93 Difference]: Finished difference Result 288 states and 337 transitions. [2024-11-28 05:08:57,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:08:57,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-28 05:08:57,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:57,336 INFO L225 Difference]: With dead ends: 288 [2024-11-28 05:08:57,336 INFO L226 Difference]: Without dead ends: 288 [2024-11-28 05:08:57,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:08:57,337 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 73 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:57,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 344 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:08:57,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-28 05:08:57,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 278. [2024-11-28 05:08:57,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 247 states have (on average 1.2995951417004048) internal successors, (321), 276 states have internal predecessors, (321), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:57,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 326 transitions. [2024-11-28 05:08:57,345 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 326 transitions. Word has length 41 [2024-11-28 05:08:57,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:57,346 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 326 transitions. [2024-11-28 05:08:57,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:57,346 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 326 transitions. [2024-11-28 05:08:57,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-28 05:08:57,346 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:57,347 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:08:57,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 05:08:57,347 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:08:57,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:57,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1745119181, now seen corresponding path program 1 times [2024-11-28 05:08:57,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:57,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49437585] [2024-11-28 05:08:57,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:57,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:57,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:57,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:57,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49437585] [2024-11-28 05:08:57,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49437585] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:08:57,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872155191] [2024-11-28 05:08:57,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:57,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:08:57,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:08:57,971 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:08:57,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 05:08:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:58,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-28 05:08:58,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:08:58,232 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 23 treesize of output 15 [2024-11-28 05:08:58,235 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 28 treesize of output 16 [2024-11-28 05:08:58,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:08:58,290 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:08:58,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872155191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:08:58,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 05:08:58,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-11-28 05:08:58,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726174548] [2024-11-28 05:08:58,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:08:58,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:08:58,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:58,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:08:58,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-11-28 05:08:58,291 INFO L87 Difference]: Start difference. First operand 278 states and 326 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:58,605 INFO L93 Difference]: Finished difference Result 286 states and 332 transitions. [2024-11-28 05:08:58,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:08:58,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-28 05:08:58,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:58,606 INFO L225 Difference]: With dead ends: 286 [2024-11-28 05:08:58,607 INFO L226 Difference]: Without dead ends: 286 [2024-11-28 05:08:58,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-11-28 05:08:58,607 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 36 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:58,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 421 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:08:58,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-28 05:08:58,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 276. [2024-11-28 05:08:58,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 247 states have (on average 1.2793522267206479) internal successors, (316), 274 states have internal predecessors, (316), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:58,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 321 transitions. [2024-11-28 05:08:58,616 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 321 transitions. Word has length 41 [2024-11-28 05:08:58,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:58,616 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 321 transitions. [2024-11-28 05:08:58,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:08:58,616 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 321 transitions. [2024-11-28 05:08:58,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-28 05:08:58,617 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:58,617 INFO L218 NwaCegarLoop]: trace histogram [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-28 05:08:58,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 05:08:58,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-28 05:08:58,818 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:08:58,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:58,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1680796568, now seen corresponding path program 1 times [2024-11-28 05:08:58,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:58,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619372926] [2024-11-28 05:08:58,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:58,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:59,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:59,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619372926] [2024-11-28 05:08:59,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619372926] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:08:59,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519942025] [2024-11-28 05:08:59,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:59,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:08:59,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:08:59,292 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:08:59,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 05:08:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:59,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 05:08:59,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:08:59,623 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:08:59,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 05:08:59,660 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-28 05:08:59,666 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-28 05:08:59,674 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-28 05:08:59,681 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-28 05:08:59,690 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-28 05:08:59,696 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-28 05:08:59,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:08:59,751 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:08:59,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519942025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:08:59,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 05:08:59,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 20 [2024-11-28 05:08:59,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043559446] [2024-11-28 05:08:59,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:08:59,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 05:08:59,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:59,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 05:08:59,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2024-11-28 05:08:59,753 INFO L87 Difference]: Start difference. First operand 276 states and 321 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:09:00,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:09:00,134 INFO L93 Difference]: Finished difference Result 290 states and 336 transitions. [2024-11-28 05:09:00,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:09:00,138 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-28 05:09:00,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:09:00,139 INFO L225 Difference]: With dead ends: 290 [2024-11-28 05:09:00,139 INFO L226 Difference]: Without dead ends: 290 [2024-11-28 05:09:00,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2024-11-28 05:09:00,141 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 13 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:09:00,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 555 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:09:00,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-28 05:09:00,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2024-11-28 05:09:00,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 260 states have (on average 1.2692307692307692) internal successors, (330), 287 states have internal predecessors, (330), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:09:00,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 335 transitions. [2024-11-28 05:09:00,147 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 335 transitions. Word has length 43 [2024-11-28 05:09:00,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:09:00,148 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 335 transitions. [2024-11-28 05:09:00,148 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:09:00,148 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 335 transitions. [2024-11-28 05:09:00,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-28 05:09:00,148 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:09:00,149 INFO L218 NwaCegarLoop]: trace histogram [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-28 05:09:00,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 05:09:00,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-28 05:09:00,349 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:09:00,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:09:00,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1733698349, now seen corresponding path program 1 times [2024-11-28 05:09:00,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:09:00,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741567445] [2024-11-28 05:09:00,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:09:00,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:09:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:09:00,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:09:00,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:09:00,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741567445] [2024-11-28 05:09:00,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741567445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:09:00,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625212680] [2024-11-28 05:09:00,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:09:00,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:09:00,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:09:00,968 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:09:00,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 05:09:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:09:01,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-28 05:09:01,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:09:01,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:09:01,236 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:09:01,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 05:09:01,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:09:01,284 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 15 treesize of output 1 [2024-11-28 05:09:01,397 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:09:01,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-28 05:09:01,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 05:09:01,432 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 16 treesize of output 8 [2024-11-28 05:09:01,497 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-28 05:09:01,531 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-28 05:09:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:09:01,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:09:01,798 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 5 [2024-11-28 05:09:02,254 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1248 (Array Int Int)) (v_ArrVal_1247 (Array Int Int)) (v_ArrVal_1250 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_100| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_100| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_100|) (< 0 (+ (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1247) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1248) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1250)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_100|) 1)))) is different from false [2024-11-28 05:09:02,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:09:02,278 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 38 treesize of output 39 [2024-11-28 05:09:02,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:09:02,287 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 30 treesize of output 31 [2024-11-28 05:09:02,291 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 54 treesize of output 46 [2024-11-28 05:09:02,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:09:02,302 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 100 treesize of output 99 [2024-11-28 05:09:02,309 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 60 treesize of output 52 [2024-11-28 05:09:02,314 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 76 treesize of output 70 [2024-11-28 05:09:02,320 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 48 treesize of output 46 [2024-11-28 05:09:02,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:09:02,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625212680] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:09:02,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:09:02,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 40 [2024-11-28 05:09:02,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371227897] [2024-11-28 05:09:02,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:09:02,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-28 05:09:02,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:09:02,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-28 05:09:02,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1375, Unknown=21, NotChecked=76, Total=1640 [2024-11-28 05:09:02,654 INFO L87 Difference]: Start difference. First operand 289 states and 335 transitions. Second operand has 41 states, 40 states have (on average 3.05) internal successors, (122), 41 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:09:05,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:09:05,516 INFO L93 Difference]: Finished difference Result 451 states and 516 transitions. [2024-11-28 05:09:05,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-28 05:09:05,517 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.05) internal successors, (122), 41 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-28 05:09:05,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:09:05,519 INFO L225 Difference]: With dead ends: 451 [2024-11-28 05:09:05,519 INFO L226 Difference]: Without dead ends: 451 [2024-11-28 05:09:05,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2266 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1113, Invalid=6350, Unknown=23, NotChecked=170, Total=7656 [2024-11-28 05:09:05,521 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 1182 mSDsluCounter, 1570 mSDsCounter, 0 mSdLazyCounter, 2062 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 2579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 395 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:09:05,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 1665 Invalid, 2579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2062 Invalid, 0 Unknown, 395 Unchecked, 1.3s Time] [2024-11-28 05:09:05,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-11-28 05:09:05,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 312. [2024-11-28 05:09:05,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 283 states have (on average 1.2756183745583038) internal successors, (361), 310 states have internal predecessors, (361), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:09:05,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 366 transitions. [2024-11-28 05:09:05,529 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 366 transitions. Word has length 44 [2024-11-28 05:09:05,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:09:05,529 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 366 transitions. [2024-11-28 05:09:05,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.05) internal successors, (122), 41 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:09:05,529 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 366 transitions. [2024-11-28 05:09:05,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-28 05:09:05,530 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:09:05,530 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:09:05,543 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 05:09:05,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-28 05:09:05,735 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:09:05,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:09:05,736 INFO L85 PathProgramCache]: Analyzing trace with hash -2089844463, now seen corresponding path program 1 times [2024-11-28 05:09:05,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:09:05,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098338104] [2024-11-28 05:09:05,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:09:05,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:09:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:09:06,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:09:06,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:09:06,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098338104] [2024-11-28 05:09:06,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098338104] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:09:06,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434297712] [2024-11-28 05:09:06,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:09:06,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:09:06,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:09:06,650 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:09:06,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 05:09:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:09:06,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-28 05:09:06,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:09:06,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:09:06,890 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:09:06,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 05:09:06,931 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 15 treesize of output 1 [2024-11-28 05:09:06,937 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 15 treesize of output 1 [2024-11-28 05:09:07,073 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:09:07,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-28 05:09:07,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 05:09:07,206 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 05:09:07,207 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 1 case distinctions, treesize of input 23 treesize of output 20 [2024-11-28 05:09:07,214 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-28 05:09:07,230 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 05:09:07,230 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 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-28 05:09:07,298 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:09:07,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2024-11-28 05:09:07,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 05:09:07,309 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 19 treesize of output 11 [2024-11-28 05:09:07,567 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 27 treesize of output 15 [2024-11-28 05:09:07,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 05:09:07,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:09:07,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:09:07,764 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 69 treesize of output 49 [2024-11-28 05:09:08,360 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1346 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1346))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_107| Int) (v_ArrVal_1351 (Array Int Int))) (or (< (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1347) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1351) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_107|) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_107| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_107|)))))) (forall ((v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1346 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1346))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (< .cse1 0) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_107| Int) (v_ArrVal_1351 (Array Int Int))) (or (< .cse1 (+ (select (select (store .cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1347) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1351) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_107|) 1)) (< |v_ULTIMATE.start_main_~x~0#1.offset_107| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_107|))))))) (or (forall ((v_ArrVal_1346 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1346) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_107| Int) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1350 (Array Int Int))) (or (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1347))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse3 (select (select (store .cse4 .cse3 v_ArrVal_1350) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_107|)))) (< |v_ULTIMATE.start_main_~x~0#1.offset_107| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_107|))))) is different from false [2024-11-28 05:09:08,417 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1346 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1346))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_107| Int) (v_ArrVal_1351 (Array Int Int))) (or (< .cse0 (+ (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1347) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1351) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_107|) 1)) (< |v_ULTIMATE.start_main_~x~0#1.offset_107| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_107|))) (< .cse0 0))))) (forall ((v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1346 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1346))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_107| Int) (v_ArrVal_1351 (Array Int Int))) (or (< (select (select (store .cse3 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1347) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1351) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_107|) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_107| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_107|))) (< (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_107| Int) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1350 (Array Int Int))) (or (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1347))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store .cse4 .cse5 v_ArrVal_1350) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_107|) .cse5))) (< |v_ULTIMATE.start_main_~x~0#1.offset_107| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_107|))) (forall ((v_ArrVal_1346 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1346) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0))))) is different from false [2024-11-28 05:09:08,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:09:08,493 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 18 treesize of output 19 [2024-11-28 05:09:08,495 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 30 treesize of output 22 [2024-11-28 05:09:08,499 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 5 [2024-11-28 05:09:08,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:09:08,507 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 51 treesize of output 36 [2024-11-28 05:09:08,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:09:08,519 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 408 treesize of output 343 [2024-11-28 05:09:08,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:09:08,538 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 287 treesize of output 263 [2024-11-28 05:09:08,546 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 255 treesize of output 239 [2024-11-28 05:09:08,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:09:08,894 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 55 treesize of output 47 [2024-11-28 05:09:08,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:09:08,905 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 28 treesize of output 29 [2024-11-28 05:09:08,909 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:09:08,913 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 26 treesize of output 18 [2024-11-28 05:09:08,917 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:09:08,930 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-11-28 05:09:08,930 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 37 treesize of output 29 [2024-11-28 05:09:08,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-28 05:09:08,958 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 05:09:08,958 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 72 treesize of output 1 [2024-11-28 05:09:09,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:09:09,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434297712] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:09:09,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:09:09,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 40 [2024-11-28 05:09:09,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761542703] [2024-11-28 05:09:09,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:09:09,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-28 05:09:09,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:09:09,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-28 05:09:09,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1273, Unknown=4, NotChecked=146, Total=1560 [2024-11-28 05:09:09,258 INFO L87 Difference]: Start difference. First operand 312 states and 366 transitions. Second operand has 40 states, 40 states have (on average 2.9) internal successors, (116), 40 states have internal predecessors, (116), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:09:11,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:09:11,489 INFO L93 Difference]: Finished difference Result 366 states and 421 transitions. [2024-11-28 05:09:11,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 05:09:11,490 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.9) internal successors, (116), 40 states have internal predecessors, (116), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-28 05:09:11,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:09:11,491 INFO L225 Difference]: With dead ends: 366 [2024-11-28 05:09:11,491 INFO L226 Difference]: Without dead ends: 366 [2024-11-28 05:09:11,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=339, Invalid=2527, Unknown=4, NotChecked=210, Total=3080 [2024-11-28 05:09:11,492 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 604 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 2008 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 1839 SdHoareTripleChecker+Invalid, 2638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 579 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:09:11,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 1839 Invalid, 2638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2008 Invalid, 0 Unknown, 579 Unchecked, 1.5s Time] [2024-11-28 05:09:11,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-28 05:09:11,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 312. [2024-11-28 05:09:11,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 283 states have (on average 1.2720848056537102) internal successors, (360), 310 states have internal predecessors, (360), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:09:11,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 365 transitions. [2024-11-28 05:09:11,499 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 365 transitions. Word has length 45 [2024-11-28 05:09:11,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:09:11,499 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 365 transitions. [2024-11-28 05:09:11,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.9) internal successors, (116), 40 states have internal predecessors, (116), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:09:11,499 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 365 transitions. [2024-11-28 05:09:11,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-28 05:09:11,500 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:09:11,500 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-28 05:09:11,510 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 05:09:11,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:09:11,704 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:09:11,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:09:11,704 INFO L85 PathProgramCache]: Analyzing trace with hash 934847769, now seen corresponding path program 1 times [2024-11-28 05:09:11,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:09:11,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666127897] [2024-11-28 05:09:11,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:09:11,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:09:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:09:12,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:09:12,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:09:12,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666127897] [2024-11-28 05:09:12,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666127897] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:09:12,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113139701] [2024-11-28 05:09:12,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:09:12,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:09:12,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:09:12,471 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:09:12,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 05:09:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:09:12,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-28 05:09:12,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:09:12,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:09:12,741 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 05:09:12,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 05:09:12,782 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 15 treesize of output 1 [2024-11-28 05:09:12,903 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:09:12,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-28 05:09:13,022 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 05:09:13,022 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 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-28 05:09:13,072 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:09:13,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-28 05:09:13,305 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-28 05:09:13,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-28 05:09:13,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-28 05:09:13,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-28 05:09:13,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-28 05:09:13,417 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 25 treesize of output 13 [2024-11-28 05:09:13,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:09:13,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:09:21,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:09:21,311 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 44 treesize of output 37 [2024-11-28 05:09:21,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:09:21,323 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 1254 treesize of output 1117 [2024-11-28 05:09:21,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 93 [2024-11-28 05:09:21,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:09:21,356 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 192 treesize of output 182 [2024-11-28 05:09:21,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 90 treesize of output 82 [2024-11-28 05:11:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:11:01,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113139701] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:11:01,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:11:01,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 15] total 41 [2024-11-28 05:11:01,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577994085] [2024-11-28 05:11:01,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:11:01,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-28 05:11:01,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:01,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-28 05:11:01,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1490, Unknown=30, NotChecked=0, Total=1722 [2024-11-28 05:11:01,644 INFO L87 Difference]: Start difference. First operand 312 states and 365 transitions. Second operand has 42 states, 41 states have (on average 3.2195121951219514) internal successors, (132), 42 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:08,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:11:08,609 INFO L93 Difference]: Finished difference Result 382 states and 438 transitions. [2024-11-28 05:11:08,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 05:11:08,610 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.2195121951219514) internal successors, (132), 42 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-28 05:11:08,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:11:08,611 INFO L225 Difference]: With dead ends: 382 [2024-11-28 05:11:08,611 INFO L226 Difference]: Without dead ends: 382 [2024-11-28 05:11:08,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 908 ImplicationChecksByTransitivity, 98.0s TimeCoverageRelationStatistics Valid=408, Invalid=2318, Unknown=30, NotChecked=0, Total=2756 [2024-11-28 05:11:08,612 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 692 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 1981 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 2053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:11:08,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1387 Invalid, 2053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1981 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-28 05:11:08,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-28 05:11:08,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 321. [2024-11-28 05:11:08,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 292 states have (on average 1.2705479452054795) internal successors, (371), 319 states have internal predecessors, (371), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:08,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 376 transitions. [2024-11-28 05:11:08,626 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 376 transitions. Word has length 46 [2024-11-28 05:11:08,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:11:08,626 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 376 transitions. [2024-11-28 05:11:08,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.2195121951219514) internal successors, (132), 42 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:08,626 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 376 transitions. [2024-11-28 05:11:08,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-28 05:11:08,627 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:11:08,627 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-28 05:11:08,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 05:11:08,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-28 05:11:08,832 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:11:08,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:08,832 INFO L85 PathProgramCache]: Analyzing trace with hash 934847770, now seen corresponding path program 1 times [2024-11-28 05:11:08,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:08,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795849757] [2024-11-28 05:11:08,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:08,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:10,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:11:10,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:10,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795849757] [2024-11-28 05:11:10,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795849757] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:11:10,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868651230] [2024-11-28 05:11:10,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:10,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:11:10,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:11:10,827 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:11:10,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 05:11:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:11,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-28 05:11:11,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:11:11,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:11:11,347 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:11:11,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 05:11:11,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:11:11,463 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 15 treesize of output 1 [2024-11-28 05:11:11,678 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:11:11,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-28 05:11:11,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 05:11:11,722 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 16 treesize of output 8 [2024-11-28 05:11:11,855 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-28 05:11:11,904 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-28 05:11:12,488 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2024-11-28 05:11:12,488 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 20 treesize of output 22 [2024-11-28 05:11:12,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-28 05:11:12,614 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 26 treesize of output 19 [2024-11-28 05:11:12,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 05:11:12,644 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 26 treesize of output 19 [2024-11-28 05:11:12,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 05:11:12,685 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 26 treesize of output 19 [2024-11-28 05:11:12,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 05:11:12,842 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 17 treesize of output 9 [2024-11-28 05:11:12,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:11:12,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:11:13,112 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1639 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmp~0#1.base| v_ArrVal_1639) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 4))) (forall ((v_ArrVal_1640 (Array Int Int)) (v_ArrVal_1639 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmp~0#1.base| v_ArrVal_1639) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmp~0#1.base| v_ArrVal_1640) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))))) is different from false [2024-11-28 05:11:13,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:11:13,488 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 91 treesize of output 95 [2024-11-28 05:11:13,792 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 105 treesize of output 93 [2024-11-28 05:11:13,798 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 82 treesize of output 80 [2024-11-28 05:11:13,804 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 80 treesize of output 78 [2024-11-28 05:11:14,055 INFO L349 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2024-11-28 05:11:14,055 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 19 treesize of output 19 [2024-11-28 05:11:15,080 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_117| Int) (v_ArrVal_1633 (Array Int Int)) (v_ArrVal_1631 (Array Int Int)) (v_ArrVal_1630 (Array Int Int)) (v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_117| 0) (= |c_ULTIMATE.start_main_~head~0#1.base| v_prenex_1) (< 0 (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1630) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1631) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1633) v_prenex_1 v_prenex_2) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_117|) 5)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_117|))) is different from false [2024-11-28 05:11:15,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:11:15,314 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 41 treesize of output 42 [2024-11-28 05:11:15,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:11:15,324 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 33 treesize of output 34 [2024-11-28 05:11:15,329 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 60 treesize of output 52 [2024-11-28 05:11:15,334 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:11:15,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:11:15,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 111 [2024-11-28 05:11:15,359 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 68 treesize of output 60 [2024-11-28 05:11:15,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 82 [2024-11-28 05:11:15,372 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 56 treesize of output 54 [2024-11-28 05:11:16,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:11:16,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868651230] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:11:16,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:11:16,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 46 [2024-11-28 05:11:16,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276090359] [2024-11-28 05:11:16,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:11:16,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-28 05:11:16,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:16,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-28 05:11:16,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1789, Unknown=19, NotChecked=174, Total=2162 [2024-11-28 05:11:16,076 INFO L87 Difference]: Start difference. First operand 321 states and 376 transitions. Second operand has 47 states, 46 states have (on average 2.9347826086956523) internal successors, (135), 47 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:22,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:11:22,300 INFO L93 Difference]: Finished difference Result 381 states and 437 transitions. [2024-11-28 05:11:22,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-28 05:11:22,301 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.9347826086956523) internal successors, (135), 47 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-28 05:11:22,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:11:22,303 INFO L225 Difference]: With dead ends: 381 [2024-11-28 05:11:22,303 INFO L226 Difference]: Without dead ends: 381 [2024-11-28 05:11:22,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=642, Invalid=3903, Unknown=19, NotChecked=266, Total=4830 [2024-11-28 05:11:22,304 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 1423 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 2074 mSolverCounterSat, 153 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1423 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 2789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 2074 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 558 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:11:22,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1423 Valid, 1423 Invalid, 2789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 2074 Invalid, 4 Unknown, 558 Unchecked, 3.7s Time] [2024-11-28 05:11:22,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-28 05:11:22,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 321. [2024-11-28 05:11:22,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 292 states have (on average 1.2671232876712328) internal successors, (370), 319 states have internal predecessors, (370), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:22,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 375 transitions. [2024-11-28 05:11:22,312 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 375 transitions. Word has length 46 [2024-11-28 05:11:22,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:11:22,312 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 375 transitions. [2024-11-28 05:11:22,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.9347826086956523) internal successors, (135), 47 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:22,313 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 375 transitions. [2024-11-28 05:11:22,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 05:11:22,313 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:11:22,313 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2024-11-28 05:11:22,326 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 05:11:22,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-28 05:11:22,518 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:11:22,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:22,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1685998060, now seen corresponding path program 1 times [2024-11-28 05:11:22,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:22,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783286399] [2024-11-28 05:11:22,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:22,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:22,590 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:11:22,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:22,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783286399] [2024-11-28 05:11:22,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783286399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:22,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:22,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:11:22,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859872509] [2024-11-28 05:11:22,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:22,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:11:22,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:22,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:11:22,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:11:22,593 INFO L87 Difference]: Start difference. First operand 321 states and 375 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:22,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:11:22,629 INFO L93 Difference]: Finished difference Result 349 states and 402 transitions. [2024-11-28 05:11:22,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:11:22,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-28 05:11:22,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:11:22,631 INFO L225 Difference]: With dead ends: 349 [2024-11-28 05:11:22,631 INFO L226 Difference]: Without dead ends: 349 [2024-11-28 05:11:22,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:11:22,632 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 40 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:11:22,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 274 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:11:22,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-28 05:11:22,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 321. [2024-11-28 05:11:22,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 292 states have (on average 1.2568493150684932) internal successors, (367), 319 states have internal predecessors, (367), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:22,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 372 transitions. [2024-11-28 05:11:22,639 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 372 transitions. Word has length 47 [2024-11-28 05:11:22,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:11:22,640 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 372 transitions. [2024-11-28 05:11:22,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:22,640 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 372 transitions. [2024-11-28 05:11:22,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 05:11:22,640 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:11:22,641 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-28 05:11:22,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 05:11:22,641 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:11:22,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:22,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1848389300, now seen corresponding path program 2 times [2024-11-28 05:11:22,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:22,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707734911] [2024-11-28 05:11:22,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:11:22,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:22,682 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:11:22,682 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:11:24,326 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:11:24,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:24,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707734911] [2024-11-28 05:11:24,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707734911] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:11:24,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026939789] [2024-11-28 05:11:24,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:11:24,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:11:24,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:11:24,329 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:11:24,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 05:11:24,552 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:11:24,552 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:11:24,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-28 05:11:24,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:11:24,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:11:24,758 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:11:24,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 05:11:24,867 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 15 treesize of output 1 [2024-11-28 05:11:25,112 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:11:25,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-28 05:11:25,321 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 05:11:25,321 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 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-28 05:11:25,468 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 05:11:25,468 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 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-28 05:11:25,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:11:25,544 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-28 05:11:25,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-28 05:11:25,672 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-28 05:11:25,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2024-11-28 05:11:25,931 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-28 05:11:25,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 48 [2024-11-28 05:11:26,252 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-11-28 05:11:26,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 48 [2024-11-28 05:11:26,429 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-28 05:11:26,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 57 [2024-11-28 05:11:26,951 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-28 05:11:26,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 24 [2024-11-28 05:11:26,956 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:11:26,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:11:27,689 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1865 (Array Int Int)) (v_ArrVal_1863 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_123| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_123|) (< |v_ULTIMATE.start_main_~x~0#1.offset_123| 0) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1863))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1865)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_123|)) 1))) is different from false [2024-11-28 05:11:27,710 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1865 (Array Int Int)) (v_ArrVal_1863 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_123| Int)) (or (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1863))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1865)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_123|)) 1) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_123|) (< |v_ULTIMATE.start_main_~x~0#1.offset_123| 0))) is different from false [2024-11-28 05:11:27,746 INFO L349 Elim1Store]: treesize reduction 5, result has 87.8 percent of original size [2024-11-28 05:11:27,746 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 45 treesize of output 44 [2024-11-28 05:11:27,764 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1865 (Array Int Int)) (v_ArrVal_1863 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_123| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_123|) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1863))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1865)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_123|) |c_ULTIMATE.start_main_~x~0#1.base|) (< |v_ULTIMATE.start_main_~x~0#1.offset_123| 0))) is different from false [2024-11-28 05:11:27,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:11:27,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2024-11-28 05:11:28,018 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1865 (Array Int Int)) (v_ArrVal_1863 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_123| Int)) (let ((.cse1 (select v_arrayElimArr_20 |ULTIMATE.start_main_~x~0#1.offset|))) (or (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_20) .cse1 v_ArrVal_1863))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1865)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_123|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| .cse1) 0)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_123|) (< |v_ULTIMATE.start_main_~x~0#1.offset_123| 0)))) is different from false [2024-11-28 05:11:29,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:11:29,122 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 134 treesize of output 86 [2024-11-28 05:11:29,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:11:29,147 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 3794 treesize of output 3325 [2024-11-28 05:11:29,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:11:29,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 883 treesize of output 769 [2024-11-28 05:11:29,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:11:29,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 928 treesize of output 768 [2024-11-28 05:11:29,274 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 754 treesize of output 714 [2024-11-28 05:11:29,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:11:29,305 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 714 treesize of output 662 [2024-11-28 05:11:29,415 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2024-11-28 05:11:29,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 61 [2024-11-28 05:11:31,391 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2024-11-28 05:11:31,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026939789] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:11:31,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:11:31,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 21] total 54 [2024-11-28 05:11:31,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781776508] [2024-11-28 05:11:31,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:11:31,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-28 05:11:31,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:31,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-28 05:11:31,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2334, Unknown=15, NotChecked=404, Total=2970 [2024-11-28 05:11:31,394 INFO L87 Difference]: Start difference. First operand 321 states and 372 transitions. Second operand has 55 states, 54 states have (on average 2.4814814814814814) internal successors, (134), 55 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:11:36,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:11:40,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:11:44,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:11:48,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:11:52,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:11:56,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:12:01,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:12:06,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:12:10,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:12:14,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:12:20,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:12:20,230 INFO L93 Difference]: Finished difference Result 438 states and 496 transitions. [2024-11-28 05:12:20,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-28 05:12:20,230 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.4814814814814814) internal successors, (134), 55 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-28 05:12:20,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:12:20,232 INFO L225 Difference]: With dead ends: 438 [2024-11-28 05:12:20,232 INFO L226 Difference]: Without dead ends: 438 [2024-11-28 05:12:20,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=590, Invalid=4523, Unknown=15, NotChecked=572, Total=5700 [2024-11-28 05:12:20,234 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 698 mSDsluCounter, 2873 mSDsCounter, 0 mSdLazyCounter, 3970 mSolverCounterSat, 104 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 2990 SdHoareTripleChecker+Invalid, 5509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 3970 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 1425 IncrementalHoareTripleChecker+Unchecked, 46.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:12:20,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 2990 Invalid, 5509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 3970 Invalid, 10 Unknown, 1425 Unchecked, 46.7s Time] [2024-11-28 05:12:20,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-28 05:12:20,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 321. [2024-11-28 05:12:20,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 292 states have (on average 1.2534246575342465) internal successors, (366), 319 states have internal predecessors, (366), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:20,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 371 transitions. [2024-11-28 05:12:20,242 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 371 transitions. Word has length 47 [2024-11-28 05:12:20,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:12:20,243 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 371 transitions. [2024-11-28 05:12:20,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.4814814814814814) internal successors, (134), 55 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:20,243 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 371 transitions. [2024-11-28 05:12:20,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 05:12:20,244 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:12:20,244 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-28 05:12:20,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-28 05:12:20,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-28 05:12:20,459 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:12:20,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:12:20,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1848389299, now seen corresponding path program 2 times [2024-11-28 05:12:20,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:12:20,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455305396] [2024-11-28 05:12:20,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:12:20,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:12:20,496 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:12:20,496 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:12:23,513 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:23,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:23,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455305396] [2024-11-28 05:12:23,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455305396] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:12:23,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777431865] [2024-11-28 05:12:23,514 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:12:23,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:12:23,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:12:23,516 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:12:23,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 05:12:23,728 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:12:23,728 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:12:23,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-28 05:12:23,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:12:23,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:12:23,922 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:12:23,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 05:12:23,931 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 8 treesize of output 1 [2024-11-28 05:12:24,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:12:24,043 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 15 treesize of output 1 [2024-11-28 05:12:24,325 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:12:24,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-28 05:12:24,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 05:12:24,599 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 05:12:24,600 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 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-28 05:12:24,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:12:24,617 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-28 05:12:24,836 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 05:12:24,836 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-28 05:12:24,872 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 05:12:24,872 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 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-28 05:12:25,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:12:25,094 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-28 05:12:25,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-28 05:12:25,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2024-11-28 05:12:25,309 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 05:12:25,309 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-28 05:12:25,358 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-28 05:12:25,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 20 [2024-11-28 05:12:25,663 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-28 05:12:25,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 67 [2024-11-28 05:12:25,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 05:12:26,023 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 05:12:26,023 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-28 05:12:26,067 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-11-28 05:12:26,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 48 [2024-11-28 05:12:26,290 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-28 05:12:26,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 69 [2024-11-28 05:12:26,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2024-11-28 05:12:26,886 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-28 05:12:26,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 24 [2024-11-28 05:12:26,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 05:12:26,970 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:12:26,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:12:28,402 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2028 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_131| Int) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int))) (or (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2024))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2023) .cse0 v_ArrVal_2028) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 11) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_2027) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_131|))))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_131|) (< |v_ULTIMATE.start_main_~x~0#1.offset_131| 0))) (forall ((v_ArrVal_2028 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_131| Int) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2023) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2024) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2028) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 9)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_131|) (< |v_ULTIMATE.start_main_~x~0#1.offset_131| 0)))) is different from false [2024-11-28 05:12:28,445 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_2028 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_131| Int) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int))) (or (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2023) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2024) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2028) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_131|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_131|) (< |v_ULTIMATE.start_main_~x~0#1.offset_131| 0))) (forall ((v_ArrVal_2028 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_131| Int) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int))) (or (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2024))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2023) .cse1 v_ArrVal_2028) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 11) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2027) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_131|))))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_131|) (< |v_ULTIMATE.start_main_~x~0#1.offset_131| 0))))) is different from false [2024-11-28 05:12:28,516 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_2028 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_131| Int) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int)) (v_ArrVal_2021 (Array Int Int))) (or (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_2024))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (< (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2021) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_2023) .cse0 v_ArrVal_2028) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 11) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_2027) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_131|))))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_131|) (< |v_ULTIMATE.start_main_~x~0#1.offset_131| 0))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_2028 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_131| Int) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int)) (v_ArrVal_2021 (Array Int Int))) (or (< 0 (+ 9 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2021) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_2023) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_2024) |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2028) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_131|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_131|) (< |v_ULTIMATE.start_main_~x~0#1.offset_131| 0))))) is different from false [2024-11-28 05:12:29,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:12:29,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2024-11-28 05:12:29,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:12:29,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 63 [2024-11-28 05:12:29,090 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_22 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_2028 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_131| Int) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int)) (v_ArrVal_2021 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_22 |ULTIMATE.start_main_~x~0#1.offset|))) (or (< 0 (+ 9 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2021) .cse0 v_ArrVal_2023) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_22) .cse0 v_ArrVal_2024) |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2028) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_131|))) (not (= (select |c_#valid| .cse0) 0)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_131|) (< |v_ULTIMATE.start_main_~x~0#1.offset_131| 0)))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_2020 Int) (v_ArrVal_2028 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_131| Int) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int)) (v_ArrVal_2021 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_23 |ULTIMATE.start_main_~x~0#1.offset|))) (or (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_23) .cse1 v_ArrVal_2024))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (< (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2021) .cse1 v_ArrVal_2023) .cse2 v_ArrVal_2028) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 11) (select (store |c_#length| .cse1 v_ArrVal_2020) (select (select (store .cse3 .cse2 v_ArrVal_2027) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_131|))))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_131|) (not (= (select |c_#valid| .cse1) 0)) (< |v_ULTIMATE.start_main_~x~0#1.offset_131| 0))))) is different from false [2024-11-28 05:12:30,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:12:30,979 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 372 treesize of output 365 [2024-11-28 05:12:30,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:12:30,996 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 356 treesize of output 245 [2024-11-28 05:12:31,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:12:31,031 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 4618 treesize of output 4185 [2024-11-28 05:12:31,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:12:31,281 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 145914 treesize of output 144464 [2024-11-28 05:12:31,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:12:31,706 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 3709 treesize of output 3372 [2024-11-28 05:12:31,767 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 3363 treesize of output 3335 [2024-11-28 05:12:31,818 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 3335 treesize of output 3247 [2024-11-28 05:12:31,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:12:31,896 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 3247 treesize of output 3064 [2024-11-28 05:12:31,946 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 3055 treesize of output 3043 [2024-11-28 05:12:32,004 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 3043 treesize of output 2955 [2024-11-28 05:12:32,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:12:32,074 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 2955 treesize of output 2796 [2024-11-28 05:12:32,134 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 2787 treesize of output 2755 [2024-11-28 05:12:32,511 INFO L349 Elim1Store]: treesize reduction 4, result has 97.2 percent of original size [2024-11-28 05:12:32,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 2762 treesize of output 2880 [2024-11-28 05:12:32,866 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 2772 treesize of output 2710 [2024-11-28 05:12:33,015 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 2667 treesize of output 2655 [2024-11-28 05:12:33,132 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 2655 treesize of output 2651 [2024-11-28 05:12:33,245 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 2651 treesize of output 2635 [2024-11-28 05:12:33,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 2635 treesize of output 2599 [2024-11-28 05:12:33,459 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 2650 treesize of output 2612 [2024-11-28 05:12:33,547 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 2571 treesize of output 2559 [2024-11-28 05:12:45,937 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2024-11-28 05:12:45,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777431865] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:12:45,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:12:45,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18, 21] total 61 [2024-11-28 05:12:45,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712649956] [2024-11-28 05:12:45,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:12:45,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-28 05:12:45,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:45,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-28 05:12:45,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=3021, Unknown=33, NotChecked=460, Total=3782 [2024-11-28 05:12:45,940 INFO L87 Difference]: Start difference. First operand 321 states and 371 transitions. Second operand has 62 states, 61 states have (on average 2.278688524590164) internal successors, (139), 62 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:12:50,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:12:54,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:12:58,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:13:02,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:13:06,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:13:10,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:13:15,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:13:19,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:13:24,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:13:28,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:13:32,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:13:46,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:13:50,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:13:54,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 05:13:58,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:14:00,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:14:04,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:14:08,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:14:12,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:14:16,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:14:20,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:14:25,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:14:26,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:14:31,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:14:35,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:14:39,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:14:40,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:14:44,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:14:48,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:14:53,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:14:54,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:14:56,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:14:57,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-28 05:14:59,866 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) 0))) (and (= (select |c_#length| |c_ULTIMATE.start_main_~head~0#1.base|) 12) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_130| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) |v_ULTIMATE.start_main_~x~0#1.offset_130|))) (and (= .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= |c_ULTIMATE.start_main_~head~0#1.base| .cse0)) (not (= .cse0 .cse1))))) (forall ((v_ArrVal_2028 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_131| Int) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int))) (or (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_2023) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_2024) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2028) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_131|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_131|) (< |v_ULTIMATE.start_main_~x~0#1.offset_131| 0))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_ArrVal_2028 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_131| Int) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int))) (or (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_2024))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_2023) .cse3 v_ArrVal_2028) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 11) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_2027) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_131|))))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_131|) (< |v_ULTIMATE.start_main_~x~0#1.offset_131| 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) 0) 0) (<= 12 (select |c_#length| .cse1)) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~head~0#1.base| .cse1)))) is different from false [2024-11-28 05:15:03,150 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_131| Int)) (or (< (+ (select .cse0 |v_ULTIMATE.start_main_~x~0#1.offset_131|) 11) (select |c_#length| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_131|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_131|) (< |v_ULTIMATE.start_main_~x~0#1.offset_131| 0))) (forall ((v_ArrVal_2028 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_131| Int)) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2028) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 9)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_131|) (< |v_ULTIMATE.start_main_~x~0#1.offset_131| 0))) (forall ((v_ArrVal_2028 (Array Int Int)) (v_ArrVal_2027 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_131| Int)) (or (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2028) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2027) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_131|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_131|) (< |v_ULTIMATE.start_main_~x~0#1.offset_131| 0))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_131| Int)) (or (< 0 (+ 9 (select .cse0 |v_ULTIMATE.start_main_~x~0#1.offset_131|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_131|) (< |v_ULTIMATE.start_main_~x~0#1.offset_131| 0))))) is different from false [2024-11-28 05:15:24,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 05:15:26,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:15:26,803 INFO L93 Difference]: Finished difference Result 612 states and 703 transitions. [2024-11-28 05:15:26,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-28 05:15:26,804 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 2.278688524590164) internal successors, (139), 62 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-28 05:15:26,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:15:26,805 INFO L225 Difference]: With dead ends: 612 [2024-11-28 05:15:26,805 INFO L226 Difference]: Without dead ends: 612 [2024-11-28 05:15:26,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 92 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2043 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=889, Invalid=6748, Unknown=43, NotChecked=1062, Total=8742 [2024-11-28 05:15:26,807 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 878 mSDsluCounter, 2820 mSDsCounter, 0 mSdLazyCounter, 3650 mSolverCounterSat, 109 mSolverCounterUnsat, 66 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 140.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 2924 SdHoareTripleChecker+Invalid, 5664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 3650 IncrementalHoareTripleChecker+Invalid, 66 IncrementalHoareTripleChecker+Unknown, 1839 IncrementalHoareTripleChecker+Unchecked, 143.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:15:26,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 2924 Invalid, 5664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 3650 Invalid, 66 Unknown, 1839 Unchecked, 143.9s Time] [2024-11-28 05:15:26,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-28 05:15:26,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 360. [2024-11-28 05:15:26,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 331 states have (on average 1.2356495468277946) internal successors, (409), 358 states have internal predecessors, (409), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:15:26,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 414 transitions. [2024-11-28 05:15:26,817 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 414 transitions. Word has length 47 [2024-11-28 05:15:26,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:15:26,817 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 414 transitions. [2024-11-28 05:15:26,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 2.278688524590164) internal successors, (139), 62 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:15:26,817 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 414 transitions. [2024-11-28 05:15:26,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-28 05:15:26,818 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:15:26,818 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:15:26,831 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 05:15:27,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-28 05:15:27,019 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:15:27,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:15:27,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1448059255, now seen corresponding path program 1 times [2024-11-28 05:15:27,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:15:27,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467666655] [2024-11-28 05:15:27,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:27,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:15:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:29,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:15:29,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:15:29,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467666655] [2024-11-28 05:15:29,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467666655] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:15:29,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794844055] [2024-11-28 05:15:29,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:29,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:15:29,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:15:29,479 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:15:29,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 05:15:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:29,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-28 05:15:29,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:15:29,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:15:30,308 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:15:30,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 05:15:30,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:15:30,563 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 15 treesize of output 1 [2024-11-28 05:15:31,185 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:15:31,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-28 05:15:31,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 05:15:31,877 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-28 05:15:31,877 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 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 05:15:31,964 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-28 05:15:31,964 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 1 case distinctions, treesize of input 27 treesize of output 22 [2024-11-28 05:15:32,459 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 05:15:32,460 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 58 [2024-11-28 05:15:32,486 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 46 treesize of output 25 [2024-11-28 05:15:34,976 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:15:34,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:15:37,627 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((v_ArrVal_2130 (Array Int Int))) (or (forall ((v_ArrVal_2131 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_140| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2130))) (let ((.cse3 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_140|))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_140| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_140|) (= (select (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 .cse2 v_ArrVal_2131)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) .cse3) 0) (< .cse3 0))))) (not (= (store .cse4 .cse2 (select v_ArrVal_2130 .cse2)) v_ArrVal_2130)))) (forall ((v_ArrVal_2130 (Array Int Int))) (or (forall ((v_ArrVal_2131 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_140| Int)) (let ((.cse6 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2130) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_140|))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_140| 0) (= (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 .cse2 v_ArrVal_2131)))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_140|))) .cse6) 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_140|) (< .cse6 0)))) (not (= (store .cse4 .cse2 (select v_ArrVal_2130 .cse2)) v_ArrVal_2130)))))) is different from false [2024-11-28 05:15:38,253 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse4 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((v_ArrVal_2130 (Array Int Int))) (or (forall ((v_ArrVal_2131 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_140| Int)) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2130) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_140|))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_140| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_140|) (= (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 .cse2 v_ArrVal_2131)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_140|))) .cse3) 0) (< .cse3 0)))) (not (= (store .cse4 .cse2 (select v_ArrVal_2130 .cse2)) v_ArrVal_2130)))) (forall ((v_ArrVal_2130 (Array Int Int))) (or (forall ((v_ArrVal_2131 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_140| Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2130))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_140|))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_140| 0) (= (select (select .cse5 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 .cse2 v_ArrVal_2131)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) .cse6) 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_140|) (< .cse6 0))))) (not (= (store .cse4 .cse2 (select v_ArrVal_2130 .cse2)) v_ArrVal_2130)))))) is different from false [2024-11-28 05:15:38,434 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base|) |c_ULTIMATE.start_main_#t~mem5#1.offset| 0)) (.cse0 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base|) |c_ULTIMATE.start_main_#t~mem5#1.offset| 0)) (.cse1 (+ |c_ULTIMATE.start_main_#t~mem5#1.offset| 8))) (and (forall ((v_ArrVal_2130 (Array Int Int))) (or (not (= v_ArrVal_2130 (store .cse0 .cse1 (select v_ArrVal_2130 .cse1)))) (forall ((v_ArrVal_2131 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_140| Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2130))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_140|))) (or (< .cse2 0) (< |v_ULTIMATE.start_main_~x~0#1.offset_140| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_140|) (= (select (select .cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| (store .cse4 .cse1 v_ArrVal_2131)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) .cse2) 0))))))) (forall ((v_ArrVal_2130 (Array Int Int))) (or (forall ((v_ArrVal_2131 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_140| Int)) (let ((.cse5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2130) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_140|))) (or (< .cse5 0) (= (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| (store .cse4 .cse1 v_ArrVal_2131)))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_140|))) .cse5) 0) (< |v_ULTIMATE.start_main_~x~0#1.offset_140| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_140|)))) (not (= v_ArrVal_2130 (store .cse0 .cse1 (select v_ArrVal_2130 .cse1)))))))) is different from false [2024-11-28 05:15:38,611 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse3 (store (select |c_#memory_$Pointer$#1.base| .cse2) .cse8 0)) (.cse5 (store (select |c_#memory_$Pointer$#1.offset| .cse2) .cse8 0)) (.cse4 (+ 8 .cse8))) (and (forall ((v_ArrVal_2130 (Array Int Int))) (or (forall ((v_ArrVal_2131 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_140| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_2130) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_140|))) (or (< .cse0 0) (< |v_ULTIMATE.start_main_~x~0#1.offset_140| 0) (= (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| .cse2 (store .cse3 .cse4 v_ArrVal_2131)))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_140|))) .cse0) 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_140|)))) (not (= (store .cse5 .cse4 (select v_ArrVal_2130 .cse4)) v_ArrVal_2130)))) (forall ((v_ArrVal_2130 (Array Int Int))) (or (forall ((v_ArrVal_2131 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_140| Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_2130))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_140|))) (or (< .cse6 0) (< |v_ULTIMATE.start_main_~x~0#1.offset_140| 0) (= (select (select .cse7 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 (store .cse3 .cse4 v_ArrVal_2131)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) .cse6) 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_140|))))) (not (= (store .cse5 .cse4 (select v_ArrVal_2130 .cse4)) v_ArrVal_2130))))))) is different from false [2024-11-28 05:15:38,985 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2125 (Array Int Int)) (v_ArrVal_2124 (Array Int Int)) (v_ArrVal_2130 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2124))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2125)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse3 (+ .cse2 8)) (.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (store (store (select .cse0 .cse1) .cse2 0) .cse3 (select v_ArrVal_2130 .cse3)) v_ArrVal_2130)) (forall ((v_ArrVal_2131 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_140| Int)) (let ((.cse6 (select (select (store .cse0 .cse1 v_ArrVal_2130) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_140|))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_140| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_140|) (= (select (let ((.cse4 (store .cse5 .cse1 (store (store (select .cse5 .cse1) .cse2 0) .cse3 v_ArrVal_2131)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_140|))) .cse6) 0) (< .cse6 0))))))))) (forall ((v_ArrVal_2125 (Array Int Int)) (v_ArrVal_2124 (Array Int Int)) (v_ArrVal_2130 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2124))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2125))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse11 (+ .cse10 8))) (or (forall ((v_ArrVal_2131 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_140| Int)) (let ((.cse7 (store .cse13 .cse9 v_ArrVal_2130))) (let ((.cse12 (select (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_140|))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_140| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_140|) (= (select (select .cse7 (select (select (store .cse8 .cse9 (store (store (select .cse8 .cse9) .cse10 0) .cse11 v_ArrVal_2131)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) .cse12) 0) (< .cse12 0))))) (not (= (store (store (select .cse13 .cse9) .cse10 0) .cse11 (select v_ArrVal_2130 .cse11)) v_ArrVal_2130)))))))) is different from false [2024-11-28 05:15:39,201 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_2125 (Array Int Int)) (v_ArrVal_2124 (Array Int Int)) (v_ArrVal_2130 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_2124))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_2125)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse3 (+ 8 .cse2)) (.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= v_ArrVal_2130 (store (store (select .cse0 .cse1) .cse2 0) .cse3 (select v_ArrVal_2130 .cse3)))) (forall ((v_ArrVal_2131 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_140| Int)) (let ((.cse4 (store .cse0 .cse1 v_ArrVal_2130))) (let ((.cse6 (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_140|))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_140| 0) (= (select (select .cse4 (select (select (store .cse5 .cse1 (store (store (select .cse5 .cse1) .cse2 0) .cse3 v_ArrVal_2131)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_140|)) .cse6) 0) (< .cse6 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_140|)))))))))) (forall ((v_ArrVal_2125 (Array Int Int)) (v_ArrVal_2124 (Array Int Int)) (v_ArrVal_2130 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_2124))) (let ((.cse12 (select (select .cse14 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse10 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_2125))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse13 (+ 8 .cse12))) (or (forall ((v_ArrVal_2131 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_140| Int)) (let ((.cse8 (select (select (store .cse14 .cse11 v_ArrVal_2130) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_140|))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_140| 0) (< .cse8 0) (= (select (let ((.cse9 (store .cse10 .cse11 (store (store (select .cse10 .cse11) .cse12 0) .cse13 v_ArrVal_2131)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_140|))) .cse8) 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_140|)))) (not (= v_ArrVal_2130 (store (store (select .cse14 .cse11) .cse12 0) .cse13 (select v_ArrVal_2130 .cse13))))))))))) is different from false [2024-11-28 05:15:39,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:15:39,437 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 360 treesize of output 288 [2024-11-28 05:15:39,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:15:39,466 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 280 treesize of output 200 [2024-11-28 05:15:41,972 INFO L349 Elim1Store]: treesize reduction 182, result has 64.5 percent of original size [2024-11-28 05:15:41,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 8032 treesize of output 7202 [2024-11-28 05:15:42,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:15:42,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:15:42,744 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 14909 treesize of output 14093 [2024-11-28 05:15:43,272 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:15:45,025 INFO L349 Elim1Store]: treesize reduction 155, result has 43.8 percent of original size [2024-11-28 05:15:45,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 5429 treesize of output 5205 [2024-11-28 05:15:45,866 INFO L224 Elim1Store]: Index analysis took 155 ms [2024-11-28 05:15:46,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:15:46,540 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 9309 treesize of output 8655 [2024-11-28 05:16:00,537 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 56 treesize of output 48 [2024-11-28 05:21:22,784 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-28 05:21:22,784 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-28 05:21:22,786 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-28 05:21:22,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-28 05:21:22,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:22,987 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:590) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2024-11-28 05:21:22,993 INFO L158 Benchmark]: Toolchain (without parser) took 786237.33ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 91.2MB in the beginning and 384.2MB in the end (delta: -293.0MB). Peak memory consumption was 697.0MB. Max. memory is 16.1GB. [2024-11-28 05:21:22,995 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 117.4MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:21:22,995 INFO L158 Benchmark]: CACSL2BoogieTranslator took 580.87ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 73.2MB in the end (delta: 17.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:21:22,996 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.65ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 71.1MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:21:22,996 INFO L158 Benchmark]: Boogie Preprocessor took 62.64ms. Allocated memory is still 117.4MB. Free memory was 71.1MB in the beginning and 68.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:21:22,996 INFO L158 Benchmark]: RCFGBuilder took 835.00ms. Allocated memory is still 117.4MB. Free memory was 68.5MB in the beginning and 38.1MB in the end (delta: 30.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 05:21:22,997 INFO L158 Benchmark]: TraceAbstraction took 784677.94ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 91.2MB in the beginning and 384.2MB in the end (delta: -292.9MB). Peak memory consumption was 691.8MB. Max. memory is 16.1GB. [2024-11-28 05:21:22,998 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.39ms. Allocated memory is still 117.4MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 580.87ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 73.2MB in the end (delta: 17.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.65ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 71.1MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.64ms. Allocated memory is still 117.4MB. Free memory was 71.1MB in the beginning and 68.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 835.00ms. Allocated memory is still 117.4MB. Free memory was 68.5MB in the beginning and 38.1MB in the end (delta: 30.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 784677.94ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 91.2MB in the beginning and 384.2MB in the end (delta: -292.9MB). Peak memory consumption was 691.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/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_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-sorted-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:21:25,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:21:26,105 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-28 05:21:26,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:21:26,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:21:26,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:21:26,166 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:21:26,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:21:26,167 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:21:26,168 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:21:26,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:21:26,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:21:26,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:21:26,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:21:26,170 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:21:26,170 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:21:26,170 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:21:26,170 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:21:26,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:21:26,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:21:26,172 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 05:21:26,172 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 05:21:26,172 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 05:21:26,172 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:21:26,172 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 05:21:26,173 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 05:21:26,173 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 05:21:26,173 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 05:21:26,173 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:21:26,173 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:21:26,173 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:21:26,173 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:21:26,174 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:21:26,174 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:21:26,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:21:26,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:21:26,174 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:21:26,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:21:26,176 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:21:26,176 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:21:26,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:21:26,176 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:21:26,177 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:21:26,177 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 05:21:26,177 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 05:21:26,177 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:21:26,177 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:21:26,177 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:21:26,177 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:21:26,177 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_314106d6-fb08-4c46-bec3-113c0f14cd17/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 [2024-11-28 05:21:26,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:21:26,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:21:26,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:21:26,608 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:21:26,609 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:21:26,610 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/forester-heap/dll-sorted-2.i [2024-11-28 05:21:29,952 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/data/00e1ea1bb/fc5680a8e4ba49d4b1a493ce1d877214/FLAGe03d687a8 [2024-11-28 05:21:30,265 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:21:30,266 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/sv-benchmarks/c/forester-heap/dll-sorted-2.i [2024-11-28 05:21:30,278 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/data/00e1ea1bb/fc5680a8e4ba49d4b1a493ce1d877214/FLAGe03d687a8 [2024-11-28 05:21:30,297 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/data/00e1ea1bb/fc5680a8e4ba49d4b1a493ce1d877214 [2024-11-28 05:21:30,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:21:30,302 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:21:30,304 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:21:30,304 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:21:30,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:21:30,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:21:30" (1/1) ... [2024-11-28 05:21:30,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d8b521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:21:30, skipping insertion in model container [2024-11-28 05:21:30,316 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:21:30" (1/1) ... [2024-11-28 05:21:30,356 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:21:30,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:21:30,805 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:21:30,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:21:30,921 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:21:30,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:21:30 WrapperNode [2024-11-28 05:21:30,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:21:30,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:21:30,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:21:30,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:21:30,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:21:30" (1/1) ... [2024-11-28 05:21:30,970 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:21:30" (1/1) ... [2024-11-28 05:21:31,021 INFO L138 Inliner]: procedures = 122, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 185 [2024-11-28 05:21:31,022 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:21:31,022 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:21:31,022 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:21:31,022 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:21:31,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:21:30" (1/1) ... [2024-11-28 05:21:31,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:21:30" (1/1) ... [2024-11-28 05:21:31,046 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:21:30" (1/1) ... [2024-11-28 05:21:31,080 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2024-11-28 05:21:31,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:21:30" (1/1) ... [2024-11-28 05:21:31,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:21:30" (1/1) ... [2024-11-28 05:21:31,106 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:21:30" (1/1) ... [2024-11-28 05:21:31,108 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:21:30" (1/1) ... [2024-11-28 05:21:31,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:21:30" (1/1) ... [2024-11-28 05:21:31,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:21:30" (1/1) ... [2024-11-28 05:21:31,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:21:30" (1/1) ... [2024-11-28 05:21:31,133 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:21:31,134 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:21:31,134 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:21:31,135 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:21:31,136 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:21:30" (1/1) ... [2024-11-28 05:21:31,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:21:31,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:21:31,201 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:21:31,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:21:31,244 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-28 05:21:31,245 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-28 05:21:31,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-28 05:21:31,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-28 05:21:31,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 05:21:31,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:21:31,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 05:21:31,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 05:21:31,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 05:21:31,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 05:21:31,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 05:21:31,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-28 05:21:31,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-28 05:21:31,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 05:21:31,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 05:21:31,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:21:31,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:21:31,480 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:21:31,483 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:21:32,572 INFO L? ?]: Removed 162 outVars from TransFormulas that were not future-live. [2024-11-28 05:21:32,572 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:21:32,599 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:21:32,599 INFO L312 CfgBuilder]: Removed 12 assume(true) statements. [2024-11-28 05:21:32,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:21:32 BoogieIcfgContainer [2024-11-28 05:21:32,600 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:21:32,604 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:21:32,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:21:32,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:21:32,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:21:30" (1/3) ... [2024-11-28 05:21:32,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1386d2be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:21:32, skipping insertion in model container [2024-11-28 05:21:32,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:21:30" (2/3) ... [2024-11-28 05:21:32,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1386d2be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:21:32, skipping insertion in model container [2024-11-28 05:21:32,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:21:32" (3/3) ... [2024-11-28 05:21:32,617 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-sorted-2.i [2024-11-28 05:21:32,637 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:21:32,639 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-sorted-2.i that has 2 procedures, 186 locations, 1 initial locations, 12 loop locations, and 75 error locations. [2024-11-28 05:21:32,702 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:21:32,724 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=None, 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;@29149735, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:21:32,724 INFO L334 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2024-11-28 05:21:32,733 INFO L276 IsEmpty]: Start isEmpty. Operand has 186 states, 103 states have (on average 2.087378640776699) internal successors, (215), 178 states have internal predecessors, (215), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 05:21:32,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 05:21:32,740 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:32,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 05:21:32,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:21:32,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:32,755 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-28 05:21:32,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:21:32,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [352897710] [2024-11-28 05:21:32,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:32,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:32,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:21:32,775 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:21:32,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 05:21:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:32,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 05:21:32,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:32,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 05:21:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:21:33,021 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:21:33,022 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:21:33,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352897710] [2024-11-28 05:21:33,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352897710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:33,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:33,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:21:33,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225264110] [2024-11-28 05:21:33,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:33,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:21:33,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:21:33,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:21:33,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:21:33,070 INFO L87 Difference]: Start difference. First operand has 186 states, 103 states have (on average 2.087378640776699) internal successors, (215), 178 states have internal predecessors, (215), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:33,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:33,542 INFO L93 Difference]: Finished difference Result 175 states and 191 transitions. [2024-11-28 05:21:33,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:21:33,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 05:21:33,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:33,558 INFO L225 Difference]: With dead ends: 175 [2024-11-28 05:21:33,559 INFO L226 Difference]: Without dead ends: 173 [2024-11-28 05:21:33,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:21:33,568 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 158 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:33,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 127 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 05:21:33,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-28 05:21:33,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-11-28 05:21:33,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 95 states have (on average 1.9263157894736842) internal successors, (183), 171 states have internal predecessors, (183), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:33,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 189 transitions. [2024-11-28 05:21:33,637 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 189 transitions. Word has length 3 [2024-11-28 05:21:33,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:33,637 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 189 transitions. [2024-11-28 05:21:33,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:33,638 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 189 transitions. [2024-11-28 05:21:33,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 05:21:33,639 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:33,639 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 05:21:33,652 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 05:21:33,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:33,841 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:21:33,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:33,842 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-28 05:21:33,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:21:33,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [765942798] [2024-11-28 05:21:33,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:33,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:33,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:21:33,845 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:21:33,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 05:21:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:33,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 05:21:33,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:33,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:21:33,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:21:33,956 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:21:33,956 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:21:33,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765942798] [2024-11-28 05:21:33,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765942798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:33,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:33,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:21:33,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201045513] [2024-11-28 05:21:33,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:33,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:21:33,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:21:33,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:21:33,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:21:33,959 INFO L87 Difference]: Start difference. First operand 173 states and 189 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:34,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:34,473 INFO L93 Difference]: Finished difference Result 170 states and 186 transitions. [2024-11-28 05:21:34,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:21:34,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 05:21:34,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:34,476 INFO L225 Difference]: With dead ends: 170 [2024-11-28 05:21:34,479 INFO L226 Difference]: Without dead ends: 170 [2024-11-28 05:21:34,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:21:34,481 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 158 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:34,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 123 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 05:21:34,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-28 05:21:34,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2024-11-28 05:21:34,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 95 states have (on average 1.894736842105263) internal successors, (180), 168 states have internal predecessors, (180), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:34,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 186 transitions. [2024-11-28 05:21:34,504 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 186 transitions. Word has length 3 [2024-11-28 05:21:34,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:34,544 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 186 transitions. [2024-11-28 05:21:34,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:34,544 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 186 transitions. [2024-11-28 05:21:34,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 05:21:34,545 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:34,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:21:34,557 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 05:21:34,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:34,745 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:21:34,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:34,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1570703282, now seen corresponding path program 1 times [2024-11-28 05:21:34,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:21:34,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1635245206] [2024-11-28 05:21:34,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:34,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:34,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:21:34,754 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:21:34,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 05:21:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:34,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 05:21:34,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:34,971 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-28 05:21:34,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-28 05:21:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:21:34,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:21:34,984 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:21:34,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635245206] [2024-11-28 05:21:34,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635245206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:34,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:34,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:21:34,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066458502] [2024-11-28 05:21:34,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:34,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:21:34,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:21:34,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:21:34,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:21:34,987 INFO L87 Difference]: Start difference. First operand 170 states and 186 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:35,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:35,687 INFO L93 Difference]: Finished difference Result 169 states and 194 transitions. [2024-11-28 05:21:35,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:21:35,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-28 05:21:35,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:35,689 INFO L225 Difference]: With dead ends: 169 [2024-11-28 05:21:35,689 INFO L226 Difference]: Without dead ends: 169 [2024-11-28 05:21:35,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:21:35,690 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 247 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:35,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 96 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 05:21:35,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-28 05:21:35,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2024-11-28 05:21:35,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 110 states have (on average 1.709090909090909) internal successors, (188), 165 states have internal predecessors, (188), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:35,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 194 transitions. [2024-11-28 05:21:35,712 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 194 transitions. Word has length 10 [2024-11-28 05:21:35,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:35,712 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 194 transitions. [2024-11-28 05:21:35,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:35,716 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 194 transitions. [2024-11-28 05:21:35,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 05:21:35,716 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:35,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:21:35,728 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 05:21:35,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:35,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:21:35,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:35,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1570703281, now seen corresponding path program 1 times [2024-11-28 05:21:35,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:21:35,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [824087770] [2024-11-28 05:21:35,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:35,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:35,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:21:35,923 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:21:35,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 05:21:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:36,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 05:21:36,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:36,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:21:36,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:21:36,298 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 9 [2024-11-28 05:21:36,315 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:21:36,316 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 13 treesize of output 13 [2024-11-28 05:21:36,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:21:36,342 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:21:36,342 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:21:36,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824087770] [2024-11-28 05:21:36,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824087770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:36,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:36,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:21:36,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262795693] [2024-11-28 05:21:36,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:36,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:21:36,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:21:36,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:21:36,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:21:36,345 INFO L87 Difference]: Start difference. First operand 167 states and 194 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:37,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:37,444 INFO L93 Difference]: Finished difference Result 240 states and 275 transitions. [2024-11-28 05:21:37,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:21:37,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-28 05:21:37,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:37,447 INFO L225 Difference]: With dead ends: 240 [2024-11-28 05:21:37,447 INFO L226 Difference]: Without dead ends: 240 [2024-11-28 05:21:37,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:21:37,448 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 525 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:37,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 189 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 05:21:37,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-28 05:21:37,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 221. [2024-11-28 05:21:37,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 164 states have (on average 1.6097560975609757) internal successors, (264), 219 states have internal predecessors, (264), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 270 transitions. [2024-11-28 05:21:37,464 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 270 transitions. Word has length 10 [2024-11-28 05:21:37,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:37,464 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 270 transitions. [2024-11-28 05:21:37,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:37,464 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 270 transitions. [2024-11-28 05:21:37,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-28 05:21:37,465 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:37,465 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:21:37,476 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 05:21:37,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:37,670 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:21:37,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:37,671 INFO L85 PathProgramCache]: Analyzing trace with hash 944043464, now seen corresponding path program 1 times [2024-11-28 05:21:37,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:21:37,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [611855697] [2024-11-28 05:21:37,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:37,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:37,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:21:37,676 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:21:37,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 05:21:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:37,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 05:21:37,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:37,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:21:37,798 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:21:37,798 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:21:37,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611855697] [2024-11-28 05:21:37,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611855697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:37,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:37,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:21:37,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906883778] [2024-11-28 05:21:37,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:37,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:21:37,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:21:37,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:21:37,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:21:37,800 INFO L87 Difference]: Start difference. First operand 221 states and 270 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:37,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:37,838 INFO L93 Difference]: Finished difference Result 270 states and 322 transitions. [2024-11-28 05:21:37,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:21:37,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-28 05:21:37,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:37,840 INFO L225 Difference]: With dead ends: 270 [2024-11-28 05:21:37,841 INFO L226 Difference]: Without dead ends: 270 [2024-11-28 05:21:37,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:21:37,842 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 58 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:37,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 343 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:21:37,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-28 05:21:37,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 235. [2024-11-28 05:21:37,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 178 states have (on average 1.601123595505618) internal successors, (285), 233 states have internal predecessors, (285), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:37,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 291 transitions. [2024-11-28 05:21:37,868 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 291 transitions. Word has length 13 [2024-11-28 05:21:37,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:37,871 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 291 transitions. [2024-11-28 05:21:37,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:37,872 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 291 transitions. [2024-11-28 05:21:37,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-28 05:21:37,872 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:37,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:21:37,883 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 05:21:38,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:38,073 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:21:38,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:38,074 INFO L85 PathProgramCache]: Analyzing trace with hash 847221851, now seen corresponding path program 1 times [2024-11-28 05:21:38,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:21:38,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1149107025] [2024-11-28 05:21:38,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:38,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:38,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:21:38,077 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:21:38,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 05:21:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:38,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-28 05:21:38,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:38,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 05:21:38,213 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 15 treesize of output 1 [2024-11-28 05:21:38,241 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 19 treesize of output 11 [2024-11-28 05:21:38,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:21:38,256 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:21:38,256 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:21:38,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149107025] [2024-11-28 05:21:38,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149107025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:38,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:38,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:21:38,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291108313] [2024-11-28 05:21:38,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:38,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:21:38,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:21:38,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:21:38,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:21:38,258 INFO L87 Difference]: Start difference. First operand 235 states and 291 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:38,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:38,934 INFO L93 Difference]: Finished difference Result 234 states and 288 transitions. [2024-11-28 05:21:38,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:21:38,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-28 05:21:38,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:38,936 INFO L225 Difference]: With dead ends: 234 [2024-11-28 05:21:38,936 INFO L226 Difference]: Without dead ends: 234 [2024-11-28 05:21:38,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:21:38,937 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 4 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:38,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 441 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 05:21:38,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-28 05:21:38,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2024-11-28 05:21:38,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 178 states have (on average 1.5842696629213484) internal successors, (282), 232 states have internal predecessors, (282), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 288 transitions. [2024-11-28 05:21:38,948 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 288 transitions. Word has length 13 [2024-11-28 05:21:38,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:38,948 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 288 transitions. [2024-11-28 05:21:38,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:38,948 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 288 transitions. [2024-11-28 05:21:38,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-28 05:21:38,949 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:38,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:21:38,961 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 05:21:39,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:39,154 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:21:39,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:39,154 INFO L85 PathProgramCache]: Analyzing trace with hash 847221852, now seen corresponding path program 1 times [2024-11-28 05:21:39,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:21:39,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1212809216] [2024-11-28 05:21:39,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:39,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:39,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:21:39,157 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:21:39,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 05:21:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:39,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-28 05:21:39,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:39,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:21:39,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 05:21:39,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:21:39,353 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 17 treesize of output 9 [2024-11-28 05:21:39,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:21:39,378 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:21:39,378 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:21:39,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212809216] [2024-11-28 05:21:39,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212809216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:39,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:39,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:21:39,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404014794] [2024-11-28 05:21:39,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:39,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:21:39,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:21:39,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:21:39,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:21:39,380 INFO L87 Difference]: Start difference. First operand 234 states and 288 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:40,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:40,167 INFO L93 Difference]: Finished difference Result 233 states and 285 transitions. [2024-11-28 05:21:40,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:21:40,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-28 05:21:40,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:40,169 INFO L225 Difference]: With dead ends: 233 [2024-11-28 05:21:40,169 INFO L226 Difference]: Without dead ends: 233 [2024-11-28 05:21:40,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:21:40,170 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 2 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:40,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 421 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 05:21:40,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-28 05:21:40,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-11-28 05:21:40,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 178 states have (on average 1.5674157303370786) internal successors, (279), 231 states have internal predecessors, (279), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:40,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 285 transitions. [2024-11-28 05:21:40,184 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 285 transitions. Word has length 13 [2024-11-28 05:21:40,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:40,184 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 285 transitions. [2024-11-28 05:21:40,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:40,184 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 285 transitions. [2024-11-28 05:21:40,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 05:21:40,185 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:40,185 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:21:40,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 05:21:40,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:40,385 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:21:40,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:40,386 INFO L85 PathProgramCache]: Analyzing trace with hash 94244445, now seen corresponding path program 1 times [2024-11-28 05:21:40,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:21:40,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [525790648] [2024-11-28 05:21:40,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:40,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:40,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:21:40,388 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:21:40,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 05:21:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:40,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-28 05:21:40,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:40,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 05:21:40,618 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 05:21:40,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-28 05:21:40,683 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 15 treesize of output 1 [2024-11-28 05:21:40,816 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:21:40,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-11-28 05:21:40,855 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 27 treesize of output 15 [2024-11-28 05:21:40,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:21:40,964 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:21:40,964 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:21:40,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525790648] [2024-11-28 05:21:40,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525790648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:40,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:40,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 05:21:40,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235430675] [2024-11-28 05:21:40,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:40,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:21:40,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:21:40,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:21:40,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:21:40,967 INFO L87 Difference]: Start difference. First operand 233 states and 285 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:42,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:42,553 INFO L93 Difference]: Finished difference Result 234 states and 283 transitions. [2024-11-28 05:21:42,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:21:42,554 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-28 05:21:42,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:42,555 INFO L225 Difference]: With dead ends: 234 [2024-11-28 05:21:42,555 INFO L226 Difference]: Without dead ends: 234 [2024-11-28 05:21:42,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-28 05:21:42,556 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 320 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:42,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 331 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 05:21:42,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-28 05:21:42,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2024-11-28 05:21:42,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 178 states have (on average 1.5561797752808988) internal successors, (277), 230 states have internal predecessors, (277), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:42,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 283 transitions. [2024-11-28 05:21:42,565 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 283 transitions. Word has length 17 [2024-11-28 05:21:42,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:42,565 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 283 transitions. [2024-11-28 05:21:42,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:42,566 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 283 transitions. [2024-11-28 05:21:42,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 05:21:42,566 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:42,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:21:42,576 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 05:21:42,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:42,767 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:21:42,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:42,768 INFO L85 PathProgramCache]: Analyzing trace with hash 94244446, now seen corresponding path program 1 times [2024-11-28 05:21:42,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:21:42,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1611348364] [2024-11-28 05:21:42,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:42,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:42,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:21:42,773 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:21:42,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 05:21:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:42,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 05:21:42,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:42,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 05:21:42,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:21:42,968 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:21:42,968 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 13 treesize of output 13 [2024-11-28 05:21:43,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:21:43,028 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 15 treesize of output 1 [2024-11-28 05:21:43,154 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:21:43,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-28 05:21:43,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 05:21:43,220 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 25 treesize of output 13 [2024-11-28 05:21:43,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 05:21:43,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:21:43,285 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:21:43,285 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:21:43,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611348364] [2024-11-28 05:21:43,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611348364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:43,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:43,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 05:21:43,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172998889] [2024-11-28 05:21:43,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:43,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:21:43,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:21:43,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:21:43,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:21:43,287 INFO L87 Difference]: Start difference. First operand 232 states and 283 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:45,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:45,106 INFO L93 Difference]: Finished difference Result 226 states and 273 transitions. [2024-11-28 05:21:45,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 05:21:45,107 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-28 05:21:45,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:45,108 INFO L225 Difference]: With dead ends: 226 [2024-11-28 05:21:45,108 INFO L226 Difference]: Without dead ends: 226 [2024-11-28 05:21:45,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2024-11-28 05:21:45,109 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 246 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:45,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 358 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-28 05:21:45,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-28 05:21:45,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 217. [2024-11-28 05:21:45,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 169 states have (on average 1.5266272189349113) internal successors, (258), 215 states have internal predecessors, (258), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:45,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 264 transitions. [2024-11-28 05:21:45,116 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 264 transitions. Word has length 17 [2024-11-28 05:21:45,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:45,116 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 264 transitions. [2024-11-28 05:21:45,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:45,117 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 264 transitions. [2024-11-28 05:21:45,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 05:21:45,117 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:45,118 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-28 05:21:45,129 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 05:21:45,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:45,319 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:21:45,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:45,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2048861905, now seen corresponding path program 1 times [2024-11-28 05:21:45,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:21:45,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [940671004] [2024-11-28 05:21:45,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:45,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:45,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:21:45,321 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:21:45,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 05:21:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:45,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 05:21:45,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:45,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:21:45,516 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:21:45,516 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:21:45,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940671004] [2024-11-28 05:21:45,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940671004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:45,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:45,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:21:45,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969332678] [2024-11-28 05:21:45,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:45,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:21:45,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:21:45,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:21:45,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:21:45,518 INFO L87 Difference]: Start difference. First operand 217 states and 264 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:45,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:45,953 INFO L93 Difference]: Finished difference Result 241 states and 273 transitions. [2024-11-28 05:21:45,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:21:45,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-28 05:21:45,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:45,955 INFO L225 Difference]: With dead ends: 241 [2024-11-28 05:21:45,955 INFO L226 Difference]: Without dead ends: 241 [2024-11-28 05:21:45,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:21:45,956 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 267 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:45,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 215 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 05:21:45,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-28 05:21:45,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 216. [2024-11-28 05:21:45,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 169 states have (on average 1.5088757396449703) internal successors, (255), 214 states have internal predecessors, (255), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:45,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 260 transitions. [2024-11-28 05:21:45,968 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 260 transitions. Word has length 28 [2024-11-28 05:21:45,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:45,969 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 260 transitions. [2024-11-28 05:21:45,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:21:45,969 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 260 transitions. [2024-11-28 05:21:45,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 05:21:45,970 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:45,970 INFO L218 NwaCegarLoop]: trace histogram [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-28 05:21:45,983 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 05:21:46,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:46,171 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:21:46,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:46,172 INFO L85 PathProgramCache]: Analyzing trace with hash -952821515, now seen corresponding path program 1 times [2024-11-28 05:21:46,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:21:46,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1194031940] [2024-11-28 05:21:46,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:46,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:21:46,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:21:46,174 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:21:46,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 05:21:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:46,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-28 05:21:46,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:21:46,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 05:21:46,425 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 05:21:46,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-28 05:21:46,507 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 15 treesize of output 1 [2024-11-28 05:21:46,704 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:21:46,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-11-28 05:21:46,882 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 05:21:46,883 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 1 case distinctions, treesize of input 35 treesize of output 26 [2024-11-28 05:21:46,996 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:21:46,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-11-28 05:21:47,193 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 27 treesize of output 15 [2024-11-28 05:21:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:21:47,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:21:47,446 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-28 05:21:47,458 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_317) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-28 05:21:47,481 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_315))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_317)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-28 05:21:47,497 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_315))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_317)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-28 05:21:47,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:21:47,523 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 40 treesize of output 33 [2024-11-28 05:21:47,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:21:47,547 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 268 treesize of output 243 [2024-11-28 05:21:47,584 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 187 treesize of output 179 [2024-11-28 05:21:47,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:21:47,612 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 179 treesize of output 175 [2024-11-28 05:22:03,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:03,382 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:22:03,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194031940] [2024-11-28 05:22:03,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194031940] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:22:03,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:22:03,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2024-11-28 05:22:03,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954920958] [2024-11-28 05:22:03,383 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:22:03,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-28 05:22:03,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:22:03,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-28 05:22:03,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=261, Unknown=13, NotChecked=148, Total=506 [2024-11-28 05:22:03,385 INFO L87 Difference]: Start difference. First operand 216 states and 260 transitions. Second operand has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:07,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:22:07,024 INFO L93 Difference]: Finished difference Result 326 states and 370 transitions. [2024-11-28 05:22:07,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 05:22:07,025 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-28 05:22:07,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:22:07,027 INFO L225 Difference]: With dead ends: 326 [2024-11-28 05:22:07,027 INFO L226 Difference]: Without dead ends: 326 [2024-11-28 05:22:07,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=97, Invalid=286, Unknown=13, NotChecked=156, Total=552 [2024-11-28 05:22:07,028 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 380 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 2386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1286 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:22:07,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 924 Invalid, 2386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1082 Invalid, 0 Unknown, 1286 Unchecked, 3.4s Time] [2024-11-28 05:22:07,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-28 05:22:07,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 242. [2024-11-28 05:22:07,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 195 states have (on average 1.4666666666666666) internal successors, (286), 240 states have internal predecessors, (286), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:07,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 291 transitions. [2024-11-28 05:22:07,036 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 291 transitions. Word has length 32 [2024-11-28 05:22:07,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:22:07,037 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 291 transitions. [2024-11-28 05:22:07,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:07,037 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 291 transitions. [2024-11-28 05:22:07,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 05:22:07,038 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:07,038 INFO L218 NwaCegarLoop]: trace histogram [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-28 05:22:07,050 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 05:22:07,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:07,239 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:22:07,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:07,239 INFO L85 PathProgramCache]: Analyzing trace with hash -952821514, now seen corresponding path program 1 times [2024-11-28 05:22:07,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:22:07,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [551034041] [2024-11-28 05:22:07,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:07,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:07,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:07,242 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:07,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 05:22:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:07,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-28 05:22:07,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:07,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 05:22:07,496 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:22:07,496 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 13 treesize of output 13 [2024-11-28 05:22:07,515 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 6 treesize of output 5 [2024-11-28 05:22:07,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:22:07,592 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 15 treesize of output 1 [2024-11-28 05:22:07,775 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:22:07,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-28 05:22:07,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 05:22:07,967 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 05:22:07,967 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-28 05:22:07,978 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-28 05:22:08,011 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 05:22:08,011 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 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-28 05:22:08,136 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:22:08,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-28 05:22:08,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 05:22:08,324 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 25 treesize of output 13 [2024-11-28 05:22:08,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 05:22:08,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:08,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:22:08,672 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_374 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_375) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_375) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0))))) is different from false [2024-11-28 05:22:08,766 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_375) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_374 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_375) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-28 05:22:08,801 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_375) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_374 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_375) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_374) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2024-11-28 05:22:09,005 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_371 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_370) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_371) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_375) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_374 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_371 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_371))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_370) .cse1 v_ArrVal_375) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_374) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2024-11-28 05:22:09,055 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_374 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_371 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_371))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_370) .cse1 v_ArrVal_375) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_374) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_371 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_370) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_371) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_375) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2024-11-28 05:22:09,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:22:09,105 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 73 treesize of output 66 [2024-11-28 05:22:09,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:22:09,116 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 57 treesize of output 50 [2024-11-28 05:22:09,122 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 84 treesize of output 72 [2024-11-28 05:22:09,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:22:09,155 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 232 treesize of output 215 [2024-11-28 05:22:09,177 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 78 treesize of output 74 [2024-11-28 05:22:09,185 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 108 treesize of output 96 [2024-11-28 05:22:09,203 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 66 treesize of output 62 [2024-11-28 05:22:09,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:22:09,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-11-28 05:22:09,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:22:09,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-28 05:22:09,388 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:22:09,389 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:22:09,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2024-11-28 05:22:09,402 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:22:09,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-28 05:22:09,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:09,690 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:22:09,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551034041] [2024-11-28 05:22:09,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551034041] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:22:09,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:22:09,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2024-11-28 05:22:09,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208678861] [2024-11-28 05:22:09,691 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:22:09,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 05:22:09,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:22:09,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 05:22:09,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=226, Unknown=5, NotChecked=170, Total=462 [2024-11-28 05:22:09,693 INFO L87 Difference]: Start difference. First operand 242 states and 291 transitions. Second operand has 22 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 22 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:13,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:22:13,514 INFO L93 Difference]: Finished difference Result 317 states and 361 transitions. [2024-11-28 05:22:13,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 05:22:13,515 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 22 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-28 05:22:13,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:22:13,517 INFO L225 Difference]: With dead ends: 317 [2024-11-28 05:22:13,517 INFO L226 Difference]: Without dead ends: 317 [2024-11-28 05:22:13,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=125, Invalid=442, Unknown=5, NotChecked=240, Total=812 [2024-11-28 05:22:13,518 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 516 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 2513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1530 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:22:13,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 725 Invalid, 2513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 951 Invalid, 0 Unknown, 1530 Unchecked, 3.2s Time] [2024-11-28 05:22:13,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-28 05:22:13,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 242. [2024-11-28 05:22:13,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 195 states have (on average 1.4615384615384615) internal successors, (285), 240 states have internal predecessors, (285), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:13,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 290 transitions. [2024-11-28 05:22:13,528 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 290 transitions. Word has length 32 [2024-11-28 05:22:13,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:22:13,528 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 290 transitions. [2024-11-28 05:22:13,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 22 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:13,528 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 290 transitions. [2024-11-28 05:22:13,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-28 05:22:13,530 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:13,530 INFO L218 NwaCegarLoop]: trace histogram [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-28 05:22:13,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 05:22:13,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:13,733 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:22:13,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:13,733 INFO L85 PathProgramCache]: Analyzing trace with hash -824757211, now seen corresponding path program 1 times [2024-11-28 05:22:13,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:22:13,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1120463190] [2024-11-28 05:22:13,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:13,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:13,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:13,737 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:13,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 05:22:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:13,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 05:22:13,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:22:13,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:22:13,882 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:22:13,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120463190] [2024-11-28 05:22:13,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120463190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:13,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:13,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:22:13,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136274773] [2024-11-28 05:22:13,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:13,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:22:13,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:22:13,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:22:13,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:22:13,884 INFO L87 Difference]: Start difference. First operand 242 states and 290 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:13,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:22:13,899 INFO L93 Difference]: Finished difference Result 244 states and 292 transitions. [2024-11-28 05:22:13,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:22:13,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-28 05:22:13,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:22:13,910 INFO L225 Difference]: With dead ends: 244 [2024-11-28 05:22:13,910 INFO L226 Difference]: Without dead ends: 244 [2024-11-28 05:22:13,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:22:13,912 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:22:13,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:22:13,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-28 05:22:13,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2024-11-28 05:22:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 197 states have (on average 1.4568527918781726) internal successors, (287), 242 states have internal predecessors, (287), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:13,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 292 transitions. [2024-11-28 05:22:13,922 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 292 transitions. Word has length 34 [2024-11-28 05:22:13,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:22:13,923 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 292 transitions. [2024-11-28 05:22:13,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:13,923 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 292 transitions. [2024-11-28 05:22:13,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 05:22:13,927 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:13,927 INFO L218 NwaCegarLoop]: trace histogram [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-28 05:22:13,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-28 05:22:14,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:14,128 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:22:14,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:14,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1086912086, now seen corresponding path program 1 times [2024-11-28 05:22:14,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:22:14,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1708025961] [2024-11-28 05:22:14,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:14,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:14,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:14,132 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:14,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 05:22:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:14,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 05:22:14,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:14,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 05:22:14,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:22:14,295 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:22:14,296 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:22:14,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708025961] [2024-11-28 05:22:14,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708025961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:14,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:14,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:22:14,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025709415] [2024-11-28 05:22:14,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:14,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:22:14,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:22:14,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:22:14,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:22:14,297 INFO L87 Difference]: Start difference. First operand 244 states and 292 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:14,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:22:14,544 INFO L93 Difference]: Finished difference Result 240 states and 284 transitions. [2024-11-28 05:22:14,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:22:14,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-28 05:22:14,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:22:14,546 INFO L225 Difference]: With dead ends: 240 [2024-11-28 05:22:14,546 INFO L226 Difference]: Without dead ends: 240 [2024-11-28 05:22:14,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:22:14,547 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 19 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:22:14,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 227 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:22:14,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-28 05:22:14,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2024-11-28 05:22:14,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 197 states have (on average 1.416243654822335) internal successors, (279), 238 states have internal predecessors, (279), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:14,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 284 transitions. [2024-11-28 05:22:14,557 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 284 transitions. Word has length 37 [2024-11-28 05:22:14,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:22:14,558 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 284 transitions. [2024-11-28 05:22:14,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:14,558 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 284 transitions. [2024-11-28 05:22:14,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 05:22:14,560 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:14,561 INFO L218 NwaCegarLoop]: trace histogram [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-28 05:22:14,573 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 05:22:14,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:14,765 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:22:14,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:14,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1086912085, now seen corresponding path program 1 times [2024-11-28 05:22:14,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:22:14,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [679042513] [2024-11-28 05:22:14,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:14,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:14,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:14,767 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:14,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 05:22:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:14,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 05:22:14,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:22:15,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:22:15,059 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:22:15,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679042513] [2024-11-28 05:22:15,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679042513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:15,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:15,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 05:22:15,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870228211] [2024-11-28 05:22:15,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:15,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:22:15,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:22:15,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:22:15,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:22:15,060 INFO L87 Difference]: Start difference. First operand 240 states and 284 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:16,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:22:16,206 INFO L93 Difference]: Finished difference Result 255 states and 301 transitions. [2024-11-28 05:22:16,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 05:22:16,207 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-28 05:22:16,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:22:16,208 INFO L225 Difference]: With dead ends: 255 [2024-11-28 05:22:16,208 INFO L226 Difference]: Without dead ends: 255 [2024-11-28 05:22:16,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:22:16,209 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 17 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:22:16,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 635 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-28 05:22:16,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-28 05:22:16,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 248. [2024-11-28 05:22:16,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 205 states have (on average 1.4048780487804877) internal successors, (288), 246 states have internal predecessors, (288), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:16,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 293 transitions. [2024-11-28 05:22:16,217 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 293 transitions. Word has length 37 [2024-11-28 05:22:16,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:22:16,217 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 293 transitions. [2024-11-28 05:22:16,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:16,217 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 293 transitions. [2024-11-28 05:22:16,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 05:22:16,218 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:16,218 INFO L218 NwaCegarLoop]: trace histogram [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-28 05:22:16,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-28 05:22:16,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:16,419 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:22:16,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:16,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1086852503, now seen corresponding path program 1 times [2024-11-28 05:22:16,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:22:16,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [559304778] [2024-11-28 05:22:16,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:16,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:16,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:16,423 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:16,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 05:22:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:16,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 05:22:16,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:16,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:22:16,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:22:16,618 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:22:16,618 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:22:16,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559304778] [2024-11-28 05:22:16,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559304778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:16,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:16,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:22:16,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600373866] [2024-11-28 05:22:16,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:16,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:22:16,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:22:16,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:22:16,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:22:16,620 INFO L87 Difference]: Start difference. First operand 248 states and 293 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:17,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:22:17,017 INFO L93 Difference]: Finished difference Result 244 states and 285 transitions. [2024-11-28 05:22:17,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:22:17,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-28 05:22:17,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:22:17,019 INFO L225 Difference]: With dead ends: 244 [2024-11-28 05:22:17,019 INFO L226 Difference]: Without dead ends: 244 [2024-11-28 05:22:17,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:22:17,021 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 19 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:22:17,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 217 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 05:22:17,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-28 05:22:17,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2024-11-28 05:22:17,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 205 states have (on average 1.3658536585365855) internal successors, (280), 242 states have internal predecessors, (280), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:17,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 285 transitions. [2024-11-28 05:22:17,028 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 285 transitions. Word has length 37 [2024-11-28 05:22:17,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:22:17,029 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 285 transitions. [2024-11-28 05:22:17,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:17,029 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 285 transitions. [2024-11-28 05:22:17,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 05:22:17,031 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:17,031 INFO L218 NwaCegarLoop]: trace histogram [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-28 05:22:17,046 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-28 05:22:17,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:17,233 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:22:17,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:17,234 INFO L85 PathProgramCache]: Analyzing trace with hash 216765830, now seen corresponding path program 1 times [2024-11-28 05:22:17,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:22:17,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [326461330] [2024-11-28 05:22:17,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:17,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:17,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:17,237 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:17,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-28 05:22:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:17,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 05:22:17,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:17,428 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 19 treesize of output 11 [2024-11-28 05:22:17,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 05:22:17,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:22:17,453 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:22:17,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326461330] [2024-11-28 05:22:17,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326461330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:22:17,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:22:17,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:22:17,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514687828] [2024-11-28 05:22:17,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:22:17,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:22:17,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:22:17,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:22:17,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:22:17,455 INFO L87 Difference]: Start difference. First operand 244 states and 285 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:18,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:22:18,502 INFO L93 Difference]: Finished difference Result 258 states and 304 transitions. [2024-11-28 05:22:18,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:22:18,503 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-28 05:22:18,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:22:18,504 INFO L225 Difference]: With dead ends: 258 [2024-11-28 05:22:18,504 INFO L226 Difference]: Without dead ends: 258 [2024-11-28 05:22:18,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:22:18,505 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 76 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:22:18,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 345 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 05:22:18,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-28 05:22:18,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 243. [2024-11-28 05:22:18,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 205 states have (on average 1.3609756097560977) internal successors, (279), 241 states have internal predecessors, (279), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:18,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 284 transitions. [2024-11-28 05:22:18,512 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 284 transitions. Word has length 37 [2024-11-28 05:22:18,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:22:18,513 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 284 transitions. [2024-11-28 05:22:18,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:22:18,513 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 284 transitions. [2024-11-28 05:22:18,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 05:22:18,514 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:18,514 INFO L218 NwaCegarLoop]: trace histogram [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-28 05:22:18,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-28 05:22:18,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:18,715 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2024-11-28 05:22:18,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:18,715 INFO L85 PathProgramCache]: Analyzing trace with hash 216765831, now seen corresponding path program 1 times [2024-11-28 05:22:18,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:22:18,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [531235780] [2024-11-28 05:22:18,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:18,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:22:18,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:22:18,718 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:22:18,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_314106d6-fb08-4c46-bec3-113c0f14cd17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-28 05:22:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:22:18,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-28 05:22:18,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:22:18,990 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:22:18,991 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 13 treesize of output 13 [2024-11-28 05:22:19,007 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 6 treesize of output 5 [2024-11-28 05:22:19,059 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 15 treesize of output 1 [2024-11-28 05:22:19,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 05:22:19,245 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:22:19,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-28 05:22:19,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 05:22:19,427 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 05:22:19,427 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-28 05:22:19,436 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-28 05:22:19,465 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-28 05:22:19,465 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 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-28 05:22:19,578 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 05:22:19,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-28 05:22:19,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 05:22:19,860 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 25 treesize of output 13 [2024-11-28 05:22:19,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 05:22:19,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:19,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:22:20,471 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_669 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_669) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_670) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_669 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_669) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2024-11-28 05:22:20,568 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_669 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_669) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_669 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_669) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_670) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-28 05:22:20,601 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_669 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_669) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_670) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_669 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_669) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse1 (bvadd .cse1 (_ bv4 32))))))) is different from false [2024-11-28 05:22:20,982 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_669 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_665) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_666) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_669) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_669 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_666))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_665) .cse1 v_ArrVal_669) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_670) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2024-11-28 05:22:21,232 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_669 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_665) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_666) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_669) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_669 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_666))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_665) .cse2 v_ArrVal_669) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_670) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2024-11-28 05:22:21,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:22:21,279 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 71 treesize of output 64 [2024-11-28 05:22:21,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:22:21,293 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 55 treesize of output 48 [2024-11-28 05:22:21,298 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 80 treesize of output 68 [2024-11-28 05:22:21,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:22:21,325 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 128 treesize of output 119 [2024-11-28 05:22:21,342 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 74 treesize of output 66 [2024-11-28 05:22:21,353 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 96 treesize of output 84 [2024-11-28 05:22:21,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 58 treesize of output 54 [2024-11-28 05:22:21,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:22:21,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-11-28 05:22:21,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:22:21,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-28 05:22:21,563 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:22:21,564 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:22:21,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2024-11-28 05:22:21,572 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:22:21,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-11-28 05:22:21,582 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 05:22:21,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:22:21,838 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:22:21,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531235780] [2024-11-28 05:22:21,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531235780] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:22:21,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:22:21,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2024-11-28 05:22:21,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237646905] [2024-11-28 05:22:21,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:22:21,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 05:22:21,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:22:21,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 05:22:21,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=291, Unknown=5, NotChecked=190, Total=552 [2024-11-28 05:22:21,842 INFO L87 Difference]: Start difference. First operand 243 states and 284 transitions. Second operand has 24 states, 23 states have (on average 3.0) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)