./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.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_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/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_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/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_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/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 9fd228108b00a337c799c923821cefd2f3f25ea1b43eb489705884efe2b6ca03 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:05:21,811 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:05:21,933 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 05:05:21,942 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:05:21,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:05:21,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:05:21,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:05:21,988 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:05:21,989 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:05:21,989 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:05:21,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:05:21,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:05:21,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:05:21,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:05:21,991 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:05:21,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:05:21,993 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:05:21,993 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:05:21,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:05:21,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:05:21,993 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 05:05:21,993 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 05:05:21,993 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 05:05:21,993 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:05:21,993 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 05:05:21,993 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 05:05:21,994 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:05:21,994 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:05:21,994 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:05:21,994 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:05:21,995 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:05:21,995 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:05:21,995 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:05:21,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:05:21,996 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:05:21,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:05:21,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:05:21,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:05:21,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:05:21,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:05:21,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:05:21,997 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 05:05:21,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 05:05:21,997 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:05:21,997 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:05:21,998 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:05:21,998 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:05:21,998 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_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/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 -> 9fd228108b00a337c799c923821cefd2f3f25ea1b43eb489705884efe2b6ca03 [2024-11-28 05:05:22,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:05:22,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:05:22,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:05:22,365 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:05:22,365 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:05:22,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.i [2024-11-28 05:05:25,882 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/data/ea04201e1/e79ea338a5f0459193b397e2018cb174/FLAGcbfccca33 [2024-11-28 05:05:26,415 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:05:26,416 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.i [2024-11-28 05:05:26,446 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/data/ea04201e1/e79ea338a5f0459193b397e2018cb174/FLAGcbfccca33 [2024-11-28 05:05:26,463 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/data/ea04201e1/e79ea338a5f0459193b397e2018cb174 [2024-11-28 05:05:26,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:05:26,470 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:05:26,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:05:26,475 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:05:26,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:05:26,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:05:26" (1/1) ... [2024-11-28 05:05:26,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60fd9f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:26, skipping insertion in model container [2024-11-28 05:05:26,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:05:26" (1/1) ... [2024-11-28 05:05:26,566 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:05:27,202 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:27,263 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:27,275 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:27,280 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:27,289 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:27,353 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:27,356 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:27,363 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:27,371 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:27,409 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:27,409 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:27,414 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:27,415 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:27,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:05:27,447 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:05:27,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:05:27,645 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:05:27,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:27 WrapperNode [2024-11-28 05:05:27,646 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:05:27,647 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:05:27,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:05:27,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:05:27,655 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:05:27" (1/1) ... [2024-11-28 05:05:27,693 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:05:27" (1/1) ... [2024-11-28 05:05:27,798 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2006 [2024-11-28 05:05:27,799 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:05:27,800 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:05:27,800 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:05:27,800 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:05:27,813 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:27" (1/1) ... [2024-11-28 05:05:27,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:27" (1/1) ... [2024-11-28 05:05:27,829 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:27" (1/1) ... [2024-11-28 05:05:28,003 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 323, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 82, 1]. [2024-11-28 05:05:28,003 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:27" (1/1) ... [2024-11-28 05:05:28,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:27" (1/1) ... [2024-11-28 05:05:28,107 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:27" (1/1) ... [2024-11-28 05:05:28,116 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:27" (1/1) ... [2024-11-28 05:05:28,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:27" (1/1) ... [2024-11-28 05:05:28,141 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:27" (1/1) ... [2024-11-28 05:05:28,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:27" (1/1) ... [2024-11-28 05:05:28,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:05:28,172 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:05:28,172 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:05:28,172 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:05:28,174 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:27" (1/1) ... [2024-11-28 05:05:28,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:05:28,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:05:28,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/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:05:28,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/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:05:28,263 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-28 05:05:28,263 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-28 05:05:28,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 05:05:28,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 05:05:28,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 05:05:28,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 05:05:28,264 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 05:05:28,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 05:05:28,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 05:05:28,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 05:05:28,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-28 05:05:28,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-28 05:05:28,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-28 05:05:28,266 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-28 05:05:28,266 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-28 05:05:28,266 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-28 05:05:28,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 05:05:28,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:05:28,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 05:05:28,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 05:05:28,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 05:05:28,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 05:05:28,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 05:05:28,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 05:05:28,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 05:05:28,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 05:05:28,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 05:05:28,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 05:05:28,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 05:05:28,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:05:28,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:05:28,601 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:05:28,604 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:05:28,633 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 05:05:28,681 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 05:05:28,711 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 05:05:33,439 INFO L? ?]: Removed 1735 outVars from TransFormulas that were not future-live. [2024-11-28 05:05:33,439 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:05:33,532 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:05:33,537 INFO L312 CfgBuilder]: Removed 47 assume(true) statements. [2024-11-28 05:05:33,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:05:33 BoogieIcfgContainer [2024-11-28 05:05:33,538 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:05:33,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:05:33,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:05:33,546 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:05:33,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:05:26" (1/3) ... [2024-11-28 05:05:33,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@529ad35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:05:33, skipping insertion in model container [2024-11-28 05:05:33,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:27" (2/3) ... [2024-11-28 05:05:33,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@529ad35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:05:33, skipping insertion in model container [2024-11-28 05:05:33,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:05:33" (3/3) ... [2024-11-28 05:05:33,549 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test5-1.i [2024-11-28 05:05:33,566 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:05:33,568 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test5-1.i that has 6 procedures, 1749 locations, 1 initial locations, 49 loop locations, and 712 error locations. [2024-11-28 05:05:33,649 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:05:33,670 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;@142e123d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:05:33,671 INFO L334 AbstractCegarLoop]: Starting to check reachability of 712 error locations. [2024-11-28 05:05:33,684 INFO L276 IsEmpty]: Start isEmpty. Operand has 1739 states, 1016 states have (on average 2.033464566929134) internal successors, (2066), 1729 states have internal predecessors, (2066), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:05:33,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 05:05:33,691 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:33,691 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 05:05:33,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:05:33,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:33,698 INFO L85 PathProgramCache]: Analyzing trace with hash 2031748298, now seen corresponding path program 1 times [2024-11-28 05:05:33,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:05:33,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887115040] [2024-11-28 05:05:33,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:33,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:05:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:33,917 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:05:33,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:05:33,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887115040] [2024-11-28 05:05:33,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887115040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:05:33,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:05:33,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:05:33,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416714781] [2024-11-28 05:05:33,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:05:33,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 05:05:33,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:05:33,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 05:05:33,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 05:05:33,973 INFO L87 Difference]: Start difference. First operand has 1739 states, 1016 states have (on average 2.033464566929134) internal successors, (2066), 1729 states have internal predecessors, (2066), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:05:34,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:05:34,140 INFO L93 Difference]: Finished difference Result 1719 states and 1979 transitions. [2024-11-28 05:05:34,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 05:05:34,143 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2024-11-28 05:05:34,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:05:34,186 INFO L225 Difference]: With dead ends: 1719 [2024-11-28 05:05:34,186 INFO L226 Difference]: Without dead ends: 1717 [2024-11-28 05:05:34,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 05:05:34,191 INFO L435 NwaCegarLoop]: 1979 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:05:34,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1979 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:05:34,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2024-11-28 05:05:34,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1717. [2024-11-28 05:05:34,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1717 states, 1006 states have (on average 1.9413518886679921) internal successors, (1953), 1707 states have internal predecessors, (1953), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 05:05:34,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 1977 transitions. [2024-11-28 05:05:34,378 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 1977 transitions. Word has length 6 [2024-11-28 05:05:34,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:05:34,381 INFO L471 AbstractCegarLoop]: Abstraction has 1717 states and 1977 transitions. [2024-11-28 05:05:34,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:05:34,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 1977 transitions. [2024-11-28 05:05:34,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 05:05:34,382 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:34,383 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 05:05:34,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 05:05:34,383 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:05:34,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:34,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1954605546, now seen corresponding path program 1 times [2024-11-28 05:05:34,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:05:34,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126373270] [2024-11-28 05:05:34,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:34,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:05:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:34,573 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:05:34,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:05:34,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126373270] [2024-11-28 05:05:34,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126373270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:05:34,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:05:34,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:05:34,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191404239] [2024-11-28 05:05:34,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:05:34,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:05:34,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:05:34,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:05:34,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:05:34,579 INFO L87 Difference]: Start difference. First operand 1717 states and 1977 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:05:36,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:05:36,460 INFO L93 Difference]: Finished difference Result 1947 states and 2295 transitions. [2024-11-28 05:05:36,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:05:36,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-28 05:05:36,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:05:36,475 INFO L225 Difference]: With dead ends: 1947 [2024-11-28 05:05:36,477 INFO L226 Difference]: Without dead ends: 1947 [2024-11-28 05:05:36,478 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:05:36,480 INFO L435 NwaCegarLoop]: 1592 mSDtfsCounter, 1738 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1749 SdHoareTripleChecker+Valid, 1921 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:05:36,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1749 Valid, 1921 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-28 05:05:36,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2024-11-28 05:05:36,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1625. [2024-11-28 05:05:36,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1625 states, 1006 states have (on average 1.8499005964214712) internal successors, (1861), 1615 states have internal predecessors, (1861), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 05:05:36,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 1885 transitions. [2024-11-28 05:05:36,561 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 1885 transitions. Word has length 6 [2024-11-28 05:05:36,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:05:36,561 INFO L471 AbstractCegarLoop]: Abstraction has 1625 states and 1885 transitions. [2024-11-28 05:05:36,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:05:36,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 1885 transitions. [2024-11-28 05:05:36,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 05:05:36,562 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:36,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 05:05:36,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 05:05:36,563 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:05:36,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:36,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1954605547, now seen corresponding path program 1 times [2024-11-28 05:05:36,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:05:36,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472104901] [2024-11-28 05:05:36,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:36,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:05:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:36,787 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:05:36,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:05:36,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472104901] [2024-11-28 05:05:36,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472104901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:05:36,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:05:36,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:05:36,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200224302] [2024-11-28 05:05:36,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:05:36,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:05:36,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:05:36,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:05:36,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:05:36,789 INFO L87 Difference]: Start difference. First operand 1625 states and 1885 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:05:38,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:05:38,772 INFO L93 Difference]: Finished difference Result 2363 states and 2787 transitions. [2024-11-28 05:05:38,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:05:38,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-28 05:05:38,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:05:38,787 INFO L225 Difference]: With dead ends: 2363 [2024-11-28 05:05:38,787 INFO L226 Difference]: Without dead ends: 2363 [2024-11-28 05:05:38,787 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:05:38,789 INFO L435 NwaCegarLoop]: 1956 mSDtfsCounter, 1218 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 2892 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:05:38,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 2892 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-28 05:05:38,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2024-11-28 05:05:38,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 1888. [2024-11-28 05:05:38,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1279 states have (on average 1.8256450351837372) internal successors, (2335), 1878 states have internal predecessors, (2335), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 05:05:38,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2359 transitions. [2024-11-28 05:05:38,869 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2359 transitions. Word has length 6 [2024-11-28 05:05:38,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:05:38,869 INFO L471 AbstractCegarLoop]: Abstraction has 1888 states and 2359 transitions. [2024-11-28 05:05:38,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:05:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2359 transitions. [2024-11-28 05:05:38,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 05:05:38,870 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:38,870 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 05:05:38,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 05:05:38,870 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:05:38,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:38,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1957151634, now seen corresponding path program 1 times [2024-11-28 05:05:38,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:05:38,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933463848] [2024-11-28 05:05:38,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:38,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:05:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:38,963 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:05:38,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:05:38,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933463848] [2024-11-28 05:05:38,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933463848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:05:38,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:05:38,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:05:38,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265238910] [2024-11-28 05:05:38,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:05:38,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:05:38,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:05:38,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:05:38,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:05:38,965 INFO L87 Difference]: Start difference. First operand 1888 states and 2359 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:05:39,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:05:39,076 INFO L93 Difference]: Finished difference Result 3757 states and 4699 transitions. [2024-11-28 05:05:39,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:05:39,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-28 05:05:39,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:05:39,096 INFO L225 Difference]: With dead ends: 3757 [2024-11-28 05:05:39,096 INFO L226 Difference]: Without dead ends: 3757 [2024-11-28 05:05:39,097 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:05:39,099 INFO L435 NwaCegarLoop]: 2384 mSDtfsCounter, 1831 mSDsluCounter, 1865 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1842 SdHoareTripleChecker+Valid, 4249 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:05:39,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1842 Valid, 4249 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:05:39,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3757 states. [2024-11-28 05:05:39,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3757 to 1890. [2024-11-28 05:05:39,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1281 states have (on average 1.8243559718969555) internal successors, (2337), 1880 states have internal predecessors, (2337), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 05:05:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2361 transitions. [2024-11-28 05:05:39,187 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2361 transitions. Word has length 6 [2024-11-28 05:05:39,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:05:39,188 INFO L471 AbstractCegarLoop]: Abstraction has 1890 states and 2361 transitions. [2024-11-28 05:05:39,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:05:39,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2361 transitions. [2024-11-28 05:05:39,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 05:05:39,188 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:39,189 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:05:39,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 05:05:39,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:05:39,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:39,190 INFO L85 PathProgramCache]: Analyzing trace with hash 748226775, now seen corresponding path program 1 times [2024-11-28 05:05:39,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:05:39,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559368138] [2024-11-28 05:05:39,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:39,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:05:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:39,341 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:05:39,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:05:39,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559368138] [2024-11-28 05:05:39,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559368138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:05:39,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:05:39,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:05:39,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908022325] [2024-11-28 05:05:39,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:05:39,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:05:39,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:05:39,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:05:39,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:05:39,344 INFO L87 Difference]: Start difference. First operand 1890 states and 2361 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:05:41,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:05:41,270 INFO L93 Difference]: Finished difference Result 1917 states and 2415 transitions. [2024-11-28 05:05:41,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:05:41,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2024-11-28 05:05:41,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:05:41,287 INFO L225 Difference]: With dead ends: 1917 [2024-11-28 05:05:41,287 INFO L226 Difference]: Without dead ends: 1917 [2024-11-28 05:05:41,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:05:41,288 INFO L435 NwaCegarLoop]: 1162 mSDtfsCounter, 2006 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2017 SdHoareTripleChecker+Valid, 2181 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:05:41,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2017 Valid, 2181 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-28 05:05:41,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2024-11-28 05:05:41,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1867. [2024-11-28 05:05:41,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1867 states, 1281 states have (on average 1.8064012490241999) internal successors, (2314), 1857 states have internal predecessors, (2314), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 05:05:41,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2338 transitions. [2024-11-28 05:05:41,341 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 2338 transitions. Word has length 12 [2024-11-28 05:05:41,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:05:41,341 INFO L471 AbstractCegarLoop]: Abstraction has 1867 states and 2338 transitions. [2024-11-28 05:05:41,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:05:41,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2338 transitions. [2024-11-28 05:05:41,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 05:05:41,342 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:41,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:05:41,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 05:05:41,343 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:05:41,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:41,343 INFO L85 PathProgramCache]: Analyzing trace with hash 748226776, now seen corresponding path program 1 times [2024-11-28 05:05:41,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:05:41,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582205222] [2024-11-28 05:05:41,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:41,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:05:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:41,479 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:05:41,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:05:41,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582205222] [2024-11-28 05:05:41,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582205222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:05:41,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:05:41,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:05:41,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266330296] [2024-11-28 05:05:41,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:05:41,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:05:41,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:05:41,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:05:41,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:05:41,481 INFO L87 Difference]: Start difference. First operand 1867 states and 2338 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:05:41,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:05:41,533 INFO L93 Difference]: Finished difference Result 1792 states and 2235 transitions. [2024-11-28 05:05:41,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:05:41,534 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), 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 12 [2024-11-28 05:05:41,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:05:41,543 INFO L225 Difference]: With dead ends: 1792 [2024-11-28 05:05:41,543 INFO L226 Difference]: Without dead ends: 1792 [2024-11-28 05:05:41,544 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:05:41,544 INFO L435 NwaCegarLoop]: 1737 mSDtfsCounter, 61 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3421 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:05:41,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3421 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:05:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2024-11-28 05:05:41,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1792. [2024-11-28 05:05:41,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1218 states have (on average 1.8152709359605912) internal successors, (2211), 1782 states have internal predecessors, (2211), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 05:05:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2235 transitions. [2024-11-28 05:05:41,596 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2235 transitions. Word has length 12 [2024-11-28 05:05:41,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:05:41,597 INFO L471 AbstractCegarLoop]: Abstraction has 1792 states and 2235 transitions. [2024-11-28 05:05:41,597 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), 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:05:41,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2235 transitions. [2024-11-28 05:05:41,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-28 05:05:41,598 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:41,598 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:05:41,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 05:05:41,599 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:05:41,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:41,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1786670129, now seen corresponding path program 1 times [2024-11-28 05:05:41,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:05:41,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75648727] [2024-11-28 05:05:41,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:41,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:05:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:41,793 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:05:41,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:05:41,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75648727] [2024-11-28 05:05:41,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75648727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:05:41,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:05:41,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:05:41,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626065966] [2024-11-28 05:05:41,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:05:41,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:05:41,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:05:41,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:05:41,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:05:41,798 INFO L87 Difference]: Start difference. First operand 1792 states and 2235 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:05:41,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:05:41,906 INFO L93 Difference]: Finished difference Result 1777 states and 2213 transitions. [2024-11-28 05:05:41,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:05:41,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2024-11-28 05:05:41,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:05:41,913 INFO L225 Difference]: With dead ends: 1777 [2024-11-28 05:05:41,914 INFO L226 Difference]: Without dead ends: 1777 [2024-11-28 05:05:41,914 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:05:41,915 INFO L435 NwaCegarLoop]: 1699 mSDtfsCounter, 45 mSDsluCounter, 3375 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5074 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:05:41,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5074 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:05:41,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2024-11-28 05:05:41,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1777. [2024-11-28 05:05:41,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1210 states have (on average 1.809090909090909) internal successors, (2189), 1767 states have internal predecessors, (2189), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 05:05:41,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2213 transitions. [2024-11-28 05:05:41,962 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2213 transitions. Word has length 14 [2024-11-28 05:05:41,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:05:41,962 INFO L471 AbstractCegarLoop]: Abstraction has 1777 states and 2213 transitions. [2024-11-28 05:05:41,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:05:41,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2213 transitions. [2024-11-28 05:05:41,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 05:05:41,963 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:41,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 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:05:41,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 05:05:41,964 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:05:41,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:41,965 INFO L85 PathProgramCache]: Analyzing trace with hash 393992639, now seen corresponding path program 1 times [2024-11-28 05:05:41,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:05:41,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653537534] [2024-11-28 05:05:41,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:41,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:05:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:42,317 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:05:42,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:05:42,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653537534] [2024-11-28 05:05:42,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653537534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:05:42,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:05:42,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:05:42,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948323397] [2024-11-28 05:05:42,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:05:42,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:05:42,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:05:42,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:05:42,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:05:42,319 INFO L87 Difference]: Start difference. First operand 1777 states and 2213 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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:05:44,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:05:44,500 INFO L93 Difference]: Finished difference Result 2298 states and 2714 transitions. [2024-11-28 05:05:44,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:05:44,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 28 [2024-11-28 05:05:44,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:05:44,510 INFO L225 Difference]: With dead ends: 2298 [2024-11-28 05:05:44,510 INFO L226 Difference]: Without dead ends: 2298 [2024-11-28 05:05:44,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:05:44,511 INFO L435 NwaCegarLoop]: 1433 mSDtfsCounter, 1223 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 3390 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:05:44,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 3390 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-28 05:05:44,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2024-11-28 05:05:44,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 1773. [2024-11-28 05:05:44,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1210 states have (on average 1.8057851239669422) internal successors, (2185), 1763 states have internal predecessors, (2185), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 05:05:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2209 transitions. [2024-11-28 05:05:44,571 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2209 transitions. Word has length 28 [2024-11-28 05:05:44,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:05:44,571 INFO L471 AbstractCegarLoop]: Abstraction has 1773 states and 2209 transitions. [2024-11-28 05:05:44,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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:05:44,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2209 transitions. [2024-11-28 05:05:44,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-28 05:05:44,576 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:44,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:44,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 05:05:44,577 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:05:44,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:44,578 INFO L85 PathProgramCache]: Analyzing trace with hash 537217013, now seen corresponding path program 1 times [2024-11-28 05:05:44,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:05:44,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681303311] [2024-11-28 05:05:44,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:44,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:05:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:44,769 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:05:44,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:05:44,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681303311] [2024-11-28 05:05:44,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681303311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:05:44,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:05:44,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:05:44,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581735480] [2024-11-28 05:05:44,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:05:44,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:05:44,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:05:44,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:05:44,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:05:44,772 INFO L87 Difference]: Start difference. First operand 1773 states and 2209 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:05:44,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:05:44,861 INFO L93 Difference]: Finished difference Result 1767 states and 2199 transitions. [2024-11-28 05:05:44,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:05:44,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2024-11-28 05:05:44,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:05:44,869 INFO L225 Difference]: With dead ends: 1767 [2024-11-28 05:05:44,869 INFO L226 Difference]: Without dead ends: 1767 [2024-11-28 05:05:44,870 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:05:44,872 INFO L435 NwaCegarLoop]: 1697 mSDtfsCounter, 21 mSDsluCounter, 3363 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5060 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:05:44,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5060 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:05:44,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2024-11-28 05:05:44,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1767. [2024-11-28 05:05:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1767 states, 1204 states have (on average 1.8064784053156147) internal successors, (2175), 1757 states have internal predecessors, (2175), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 05:05:44,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2199 transitions. [2024-11-28 05:05:44,914 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2199 transitions. Word has length 62 [2024-11-28 05:05:44,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:05:44,916 INFO L471 AbstractCegarLoop]: Abstraction has 1767 states and 2199 transitions. [2024-11-28 05:05:44,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:05:44,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2199 transitions. [2024-11-28 05:05:44,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 05:05:44,917 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:44,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:44,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 05:05:44,918 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:05:44,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:44,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1829680703, now seen corresponding path program 1 times [2024-11-28 05:05:44,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:05:44,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131143131] [2024-11-28 05:05:44,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:44,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:05:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:45,190 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:05:45,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:05:45,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131143131] [2024-11-28 05:05:45,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131143131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:05:45,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:05:45,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:05:45,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088378549] [2024-11-28 05:05:45,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:05:45,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:05:45,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:05:45,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:05:45,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:05:45,193 INFO L87 Difference]: Start difference. First operand 1767 states and 2199 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:05:45,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:05:45,264 INFO L93 Difference]: Finished difference Result 1860 states and 2319 transitions. [2024-11-28 05:05:45,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:05:45,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 70 [2024-11-28 05:05:45,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:05:45,274 INFO L225 Difference]: With dead ends: 1860 [2024-11-28 05:05:45,274 INFO L226 Difference]: Without dead ends: 1860 [2024-11-28 05:05:45,274 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:05:45,276 INFO L435 NwaCegarLoop]: 1712 mSDtfsCounter, 54 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 3397 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:05:45,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 3397 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:05:45,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2024-11-28 05:05:45,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1860. [2024-11-28 05:05:45,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1860 states, 1297 states have (on average 1.7694680030840402) internal successors, (2295), 1850 states have internal predecessors, (2295), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 05:05:45,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 2319 transitions. [2024-11-28 05:05:45,338 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 2319 transitions. Word has length 70 [2024-11-28 05:05:45,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:05:45,339 INFO L471 AbstractCegarLoop]: Abstraction has 1860 states and 2319 transitions. [2024-11-28 05:05:45,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:05:45,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 2319 transitions. [2024-11-28 05:05:45,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-28 05:05:45,342 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:45,344 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:45,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 05:05:45,345 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:05:45,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:45,345 INFO L85 PathProgramCache]: Analyzing trace with hash -696902437, now seen corresponding path program 1 times [2024-11-28 05:05:45,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:05:45,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427860713] [2024-11-28 05:05:45,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:45,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:05:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:46,198 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:05:46,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:05:46,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427860713] [2024-11-28 05:05:46,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427860713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:05:46,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:05:46,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:05:46,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650107341] [2024-11-28 05:05:46,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:05:46,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:05:46,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:05:46,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:05:46,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:05:46,202 INFO L87 Difference]: Start difference. First operand 1860 states and 2319 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 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:05:48,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:05:48,086 INFO L93 Difference]: Finished difference Result 1776 states and 2235 transitions. [2024-11-28 05:05:48,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:05:48,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 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 73 [2024-11-28 05:05:48,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:05:48,093 INFO L225 Difference]: With dead ends: 1776 [2024-11-28 05:05:48,093 INFO L226 Difference]: Without dead ends: 1776 [2024-11-28 05:05:48,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:05:48,094 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 3048 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3059 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 1760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:05:48,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3059 Valid, 1614 Invalid, 1760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-28 05:05:48,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2024-11-28 05:05:48,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1503. [2024-11-28 05:05:48,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1024 states have (on average 1.6865234375) internal successors, (1727), 1493 states have internal predecessors, (1727), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 05:05:48,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1751 transitions. [2024-11-28 05:05:48,125 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1751 transitions. Word has length 73 [2024-11-28 05:05:48,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:05:48,125 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 1751 transitions. [2024-11-28 05:05:48,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 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:05:48,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1751 transitions. [2024-11-28 05:05:48,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-28 05:05:48,126 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:48,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:48,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 05:05:48,127 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:05:48,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:48,127 INFO L85 PathProgramCache]: Analyzing trace with hash 567023701, now seen corresponding path program 1 times [2024-11-28 05:05:48,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:05:48,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434067792] [2024-11-28 05:05:48,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:48,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:05:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:48,926 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:05:48,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:05:48,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434067792] [2024-11-28 05:05:48,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434067792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:05:48,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:05:48,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:05:48,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627415368] [2024-11-28 05:05:48,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:05:48,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:05:48,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:05:48,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:05:48,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:05:48,928 INFO L87 Difference]: Start difference. First operand 1503 states and 1751 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 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:05:50,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:05:50,618 INFO L93 Difference]: Finished difference Result 1502 states and 1750 transitions. [2024-11-28 05:05:50,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:05:50,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2024-11-28 05:05:50,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:05:50,623 INFO L225 Difference]: With dead ends: 1502 [2024-11-28 05:05:50,623 INFO L226 Difference]: Without dead ends: 1502 [2024-11-28 05:05:50,624 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:05:50,624 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 2 mSDsluCounter, 3180 mSDsCounter, 0 mSdLazyCounter, 1699 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4804 SdHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:05:50,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4804 Invalid, 1700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1699 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-28 05:05:50,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2024-11-28 05:05:50,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1502. [2024-11-28 05:05:50,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1024 states have (on average 1.685546875) internal successors, (1726), 1492 states have internal predecessors, (1726), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 05:05:50,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1750 transitions. [2024-11-28 05:05:50,659 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1750 transitions. Word has length 78 [2024-11-28 05:05:50,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:05:50,660 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 1750 transitions. [2024-11-28 05:05:50,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 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:05:50,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1750 transitions. [2024-11-28 05:05:50,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-28 05:05:50,663 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:50,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:50,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 05:05:50,663 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:05:50,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:50,664 INFO L85 PathProgramCache]: Analyzing trace with hash 567023700, now seen corresponding path program 1 times [2024-11-28 05:05:50,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:05:50,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035749393] [2024-11-28 05:05:50,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:50,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:05:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:51,044 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:05:51,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:05:51,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035749393] [2024-11-28 05:05:51,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035749393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:05:51,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:05:51,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:05:51,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422235003] [2024-11-28 05:05:51,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:05:51,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:05:51,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:05:51,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:05:51,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:05:51,047 INFO L87 Difference]: Start difference. First operand 1502 states and 1750 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 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:05:52,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:05:52,694 INFO L93 Difference]: Finished difference Result 1501 states and 1749 transitions. [2024-11-28 05:05:52,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:05:52,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2024-11-28 05:05:52,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:05:52,705 INFO L225 Difference]: With dead ends: 1501 [2024-11-28 05:05:52,705 INFO L226 Difference]: Without dead ends: 1501 [2024-11-28 05:05:52,705 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:05:52,706 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 1 mSDsluCounter, 3158 mSDsCounter, 0 mSdLazyCounter, 1718 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4782 SdHoareTripleChecker+Invalid, 1719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:05:52,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4782 Invalid, 1719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1718 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-28 05:05:52,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2024-11-28 05:05:52,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1501. [2024-11-28 05:05:52,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1023 states have (on average 1.686217008797654) internal successors, (1725), 1491 states have internal predecessors, (1725), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 05:05:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1749 transitions. [2024-11-28 05:05:52,734 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1749 transitions. Word has length 78 [2024-11-28 05:05:52,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:05:52,734 INFO L471 AbstractCegarLoop]: Abstraction has 1501 states and 1749 transitions. [2024-11-28 05:05:52,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 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:05:52,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1749 transitions. [2024-11-28 05:05:52,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-28 05:05:52,738 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:52,738 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:52,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 05:05:52,738 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:05:52,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:52,739 INFO L85 PathProgramCache]: Analyzing trace with hash 2048500027, now seen corresponding path program 1 times [2024-11-28 05:05:52,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:05:52,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683311911] [2024-11-28 05:05:52,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:52,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:05:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:53,069 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:05:53,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:05:53,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683311911] [2024-11-28 05:05:53,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683311911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:05:53,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:05:53,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 05:05:53,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177961514] [2024-11-28 05:05:53,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:05:53,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:05:53,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:05:53,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:05:53,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:05:53,073 INFO L87 Difference]: Start difference. First operand 1501 states and 1749 transitions. Second operand has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:05:54,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:05:54,915 INFO L93 Difference]: Finished difference Result 1513 states and 1767 transitions. [2024-11-28 05:05:54,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:05:54,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2024-11-28 05:05:54,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:05:54,926 INFO L225 Difference]: With dead ends: 1513 [2024-11-28 05:05:54,930 INFO L226 Difference]: Without dead ends: 1513 [2024-11-28 05:05:54,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:05:54,931 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 13 mSDsluCounter, 4846 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6452 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:05:54,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6452 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-28 05:05:54,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2024-11-28 05:05:54,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1507. [2024-11-28 05:05:54,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1028 states have (on average 1.6848249027237354) internal successors, (1732), 1496 states have internal predecessors, (1732), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-28 05:05:54,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1762 transitions. [2024-11-28 05:05:54,980 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1762 transitions. Word has length 86 [2024-11-28 05:05:54,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:05:54,980 INFO L471 AbstractCegarLoop]: Abstraction has 1507 states and 1762 transitions. [2024-11-28 05:05:54,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:05:54,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1762 transitions. [2024-11-28 05:05:54,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-28 05:05:54,984 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:54,984 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:54,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 05:05:54,984 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:05:54,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:54,985 INFO L85 PathProgramCache]: Analyzing trace with hash 2048500028, now seen corresponding path program 1 times [2024-11-28 05:05:54,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:05:54,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139423410] [2024-11-28 05:05:54,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:54,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:05:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:55,678 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:05:55,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:05:55,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139423410] [2024-11-28 05:05:55,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139423410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:05:55,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:05:55,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 05:05:55,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936266474] [2024-11-28 05:05:55,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:05:55,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:05:55,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:05:55,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:05:55,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:05:55,681 INFO L87 Difference]: Start difference. First operand 1507 states and 1762 transitions. Second operand has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:05:57,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:05:57,817 INFO L93 Difference]: Finished difference Result 1507 states and 1761 transitions. [2024-11-28 05:05:57,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:05:57,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2024-11-28 05:05:57,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:05:57,822 INFO L225 Difference]: With dead ends: 1507 [2024-11-28 05:05:57,823 INFO L226 Difference]: Without dead ends: 1507 [2024-11-28 05:05:57,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:05:57,823 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 8 mSDsluCounter, 4526 mSDsCounter, 0 mSdLazyCounter, 1969 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6139 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:05:57,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6139 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1969 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-28 05:05:57,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2024-11-28 05:05:57,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2024-11-28 05:05:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1028 states have (on average 1.683852140077821) internal successors, (1731), 1496 states have internal predecessors, (1731), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-28 05:05:57,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1761 transitions. [2024-11-28 05:05:57,849 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1761 transitions. Word has length 86 [2024-11-28 05:05:57,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:05:57,849 INFO L471 AbstractCegarLoop]: Abstraction has 1507 states and 1761 transitions. [2024-11-28 05:05:57,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:05:57,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1761 transitions. [2024-11-28 05:05:57,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-28 05:05:57,850 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:57,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:57,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 05:05:57,851 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:05:57,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:57,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1457933393, now seen corresponding path program 1 times [2024-11-28 05:05:57,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:05:57,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140185974] [2024-11-28 05:05:57,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:57,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:05:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:58,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:05:58,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:05:58,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140185974] [2024-11-28 05:05:58,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140185974] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:05:58,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148935207] [2024-11-28 05:05:58,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:58,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:05:58,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:05:58,518 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:05:58,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 05:05:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:58,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 05:05:58,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:05:58,963 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:05:59,141 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:05:59,141 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:05:59,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 05:05:59,254 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:05:59,255 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 42 treesize of output 41 [2024-11-28 05:05:59,297 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 31 treesize of output 13 [2024-11-28 05:05:59,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:05:59,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:05:59,389 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-28 05:05:59,389 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 21 treesize of output 20 [2024-11-28 05:05:59,399 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_535) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2024-11-28 05:05:59,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148935207] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:05:59,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:05:59,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2024-11-28 05:05:59,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506851469] [2024-11-28 05:05:59,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:05:59,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 05:05:59,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:05:59,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 05:05:59,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2024-11-28 05:05:59,405 INFO L87 Difference]: Start difference. First operand 1507 states and 1761 transitions. Second operand has 14 states, 12 states have (on average 10.333333333333334) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 05:06:03,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:03,178 INFO L93 Difference]: Finished difference Result 1506 states and 1760 transitions. [2024-11-28 05:06:03,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 05:06:03,179 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.333333333333334) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 87 [2024-11-28 05:06:03,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:03,184 INFO L225 Difference]: With dead ends: 1506 [2024-11-28 05:06:03,184 INFO L226 Difference]: Without dead ends: 1506 [2024-11-28 05:06:03,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=342, Unknown=1, NotChecked=38, Total=462 [2024-11-28 05:06:03,185 INFO L435 NwaCegarLoop]: 1047 mSDtfsCounter, 1545 mSDsluCounter, 8196 mSDsCounter, 0 mSdLazyCounter, 5383 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1560 SdHoareTripleChecker+Valid, 9243 SdHoareTripleChecker+Invalid, 5409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:03,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1560 Valid, 9243 Invalid, 5409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5383 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-28 05:06:03,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2024-11-28 05:06:03,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2024-11-28 05:06:03,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1028 states have (on average 1.6828793774319066) internal successors, (1730), 1495 states have internal predecessors, (1730), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-28 05:06:03,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 1760 transitions. [2024-11-28 05:06:03,215 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 1760 transitions. Word has length 87 [2024-11-28 05:06:03,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:03,216 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 1760 transitions. [2024-11-28 05:06:03,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.333333333333334) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 05:06:03,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 1760 transitions. [2024-11-28 05:06:03,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-28 05:06:03,217 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:03,217 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:03,230 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 05:06:03,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-28 05:06:03,418 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:06:03,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:03,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1457933392, now seen corresponding path program 1 times [2024-11-28 05:06:03,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:03,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847328697] [2024-11-28 05:06:03,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:03,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:04,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:04,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:04,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847328697] [2024-11-28 05:06:04,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847328697] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:06:04,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735374211] [2024-11-28 05:06:04,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:04,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:04,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:06:04,398 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:06:04,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 05:06:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:04,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-28 05:06:04,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:06:04,779 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:06:04,951 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:06:04,968 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:06:04,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 11 treesize of output 11 [2024-11-28 05:06:05,016 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 13 treesize of output 9 [2024-11-28 05:06:05,029 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 1 [2024-11-28 05:06:05,157 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 22 treesize of output 10 [2024-11-28 05:06:05,163 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 9 treesize of output 3 [2024-11-28 05:06:05,339 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:06:05,340 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 62 treesize of output 57 [2024-11-28 05:06:05,347 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 30 treesize of output 13 [2024-11-28 05:06:05,409 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 31 treesize of output 13 [2024-11-28 05:06:05,415 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 9 treesize of output 3 [2024-11-28 05:06:05,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:05,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:06:05,587 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_668 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int))) (<= (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_669) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 05:06:05,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735374211] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:06:05,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:06:05,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-28 05:06:05,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419344390] [2024-11-28 05:06:05,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:06:05,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 05:06:05,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:06:05,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 05:06:05,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2024-11-28 05:06:05,595 INFO L87 Difference]: Start difference. First operand 1506 states and 1760 transitions. Second operand has 18 states, 15 states have (on average 9.066666666666666) internal successors, (136), 18 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:06:10,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:10,753 INFO L93 Difference]: Finished difference Result 1513 states and 1767 transitions. [2024-11-28 05:06:10,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:06:10,753 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.066666666666666) internal successors, (136), 18 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 87 [2024-11-28 05:06:10,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:10,757 INFO L225 Difference]: With dead ends: 1513 [2024-11-28 05:06:10,757 INFO L226 Difference]: Without dead ends: 1513 [2024-11-28 05:06:10,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=463, Unknown=1, NotChecked=44, Total=600 [2024-11-28 05:06:10,758 INFO L435 NwaCegarLoop]: 1052 mSDtfsCounter, 1544 mSDsluCounter, 7870 mSDsCounter, 0 mSdLazyCounter, 7333 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 8922 SdHoareTripleChecker+Invalid, 7376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 7333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:10,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1559 Valid, 8922 Invalid, 7376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 7333 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-28 05:06:10,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2024-11-28 05:06:10,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1504. [2024-11-28 05:06:10,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1027 states have (on average 1.6825705939629991) internal successors, (1728), 1493 states have internal predecessors, (1728), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 05:06:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1752 transitions. [2024-11-28 05:06:10,789 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1752 transitions. Word has length 87 [2024-11-28 05:06:10,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:10,789 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 1752 transitions. [2024-11-28 05:06:10,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.066666666666666) internal successors, (136), 18 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:06:10,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1752 transitions. [2024-11-28 05:06:10,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-28 05:06:10,791 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:10,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:10,804 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 05:06:10,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-28 05:06:10,996 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:06:10,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:10,996 INFO L85 PathProgramCache]: Analyzing trace with hash -325374910, now seen corresponding path program 1 times [2024-11-28 05:06:10,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:10,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466529249] [2024-11-28 05:06:10,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:10,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:11,684 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:06:11,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:11,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466529249] [2024-11-28 05:06:11,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466529249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:11,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:11,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 05:06:11,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263896964] [2024-11-28 05:06:11,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:11,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 05:06:11,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:06:11,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 05:06:11,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-28 05:06:11,686 INFO L87 Difference]: Start difference. First operand 1504 states and 1752 transitions. Second operand has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:06:15,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:15,198 INFO L93 Difference]: Finished difference Result 1517 states and 1771 transitions. [2024-11-28 05:06:15,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 05:06:15,199 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-11-28 05:06:15,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:15,204 INFO L225 Difference]: With dead ends: 1517 [2024-11-28 05:06:15,204 INFO L226 Difference]: Without dead ends: 1517 [2024-11-28 05:06:15,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-28 05:06:15,205 INFO L435 NwaCegarLoop]: 1046 mSDtfsCounter, 1550 mSDsluCounter, 8161 mSDsCounter, 0 mSdLazyCounter, 5416 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1565 SdHoareTripleChecker+Valid, 9207 SdHoareTripleChecker+Invalid, 5442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:15,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1565 Valid, 9207 Invalid, 5442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5416 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-28 05:06:15,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-11-28 05:06:15,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1513. [2024-11-28 05:06:15,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1035 states have (on average 1.6792270531400966) internal successors, (1738), 1501 states have internal predecessors, (1738), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 05:06:15,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1763 transitions. [2024-11-28 05:06:15,241 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1763 transitions. Word has length 89 [2024-11-28 05:06:15,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:15,241 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1763 transitions. [2024-11-28 05:06:15,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:06:15,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1763 transitions. [2024-11-28 05:06:15,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-28 05:06:15,243 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:15,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:15,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 05:06:15,244 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:06:15,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:15,244 INFO L85 PathProgramCache]: Analyzing trace with hash -325374909, now seen corresponding path program 1 times [2024-11-28 05:06:15,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:15,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871758538] [2024-11-28 05:06:15,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:15,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:16,269 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:06:16,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:16,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871758538] [2024-11-28 05:06:16,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871758538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:16,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:16,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 05:06:16,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047131829] [2024-11-28 05:06:16,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:16,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 05:06:16,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:06:16,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 05:06:16,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 05:06:16,271 INFO L87 Difference]: Start difference. First operand 1513 states and 1763 transitions. Second operand has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:06:20,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:20,626 INFO L93 Difference]: Finished difference Result 1516 states and 1770 transitions. [2024-11-28 05:06:20,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 05:06:20,626 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-11-28 05:06:20,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:20,630 INFO L225 Difference]: With dead ends: 1516 [2024-11-28 05:06:20,630 INFO L226 Difference]: Without dead ends: 1516 [2024-11-28 05:06:20,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-28 05:06:20,631 INFO L435 NwaCegarLoop]: 1053 mSDtfsCounter, 1544 mSDsluCounter, 7056 mSDsCounter, 0 mSdLazyCounter, 6475 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 8109 SdHoareTripleChecker+Invalid, 6499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:20,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1559 Valid, 8109 Invalid, 6499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 6475 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-28 05:06:20,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-11-28 05:06:20,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1513. [2024-11-28 05:06:20,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1035 states have (on average 1.6782608695652175) internal successors, (1737), 1501 states have internal predecessors, (1737), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 05:06:20,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1762 transitions. [2024-11-28 05:06:20,656 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1762 transitions. Word has length 89 [2024-11-28 05:06:20,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:20,656 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1762 transitions. [2024-11-28 05:06:20,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:06:20,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1762 transitions. [2024-11-28 05:06:20,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-28 05:06:20,657 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:20,657 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:20,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 05:06:20,658 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:06:20,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:20,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1711183182, now seen corresponding path program 1 times [2024-11-28 05:06:20,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:20,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998629304] [2024-11-28 05:06:20,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:20,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:21,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:21,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998629304] [2024-11-28 05:06:21,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998629304] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:06:21,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524163380] [2024-11-28 05:06:21,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:21,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:21,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:06:21,366 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:06:21,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 05:06:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:21,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-28 05:06:21,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:06:21,697 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:06:21,841 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:06:21,841 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:06:21,849 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 1 [2024-11-28 05:06:21,918 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:06:21,918 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 42 treesize of output 41 [2024-11-28 05:06:21,987 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:06:21,987 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 42 treesize of output 41 [2024-11-28 05:06:22,005 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 31 treesize of output 13 [2024-11-28 05:06:22,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:22,010 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:06:22,065 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_926 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-28 05:06:22,124 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-28 05:06:22,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-28 05:06:22,133 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_926 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_929))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_926)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-28 05:06:22,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524163380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:06:22,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:06:22,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2024-11-28 05:06:22,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530210745] [2024-11-28 05:06:22,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:06:22,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 05:06:22,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:06:22,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 05:06:22,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=225, Unknown=6, NotChecked=62, Total=342 [2024-11-28 05:06:22,137 INFO L87 Difference]: Start difference. First operand 1513 states and 1762 transitions. Second operand has 16 states, 14 states have (on average 9.214285714285714) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:06:26,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:26,536 INFO L93 Difference]: Finished difference Result 1515 states and 1769 transitions. [2024-11-28 05:06:26,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 05:06:26,537 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.214285714285714) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2024-11-28 05:06:26,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:26,539 INFO L225 Difference]: With dead ends: 1515 [2024-11-28 05:06:26,539 INFO L226 Difference]: Without dead ends: 1515 [2024-11-28 05:06:26,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=454, Unknown=6, NotChecked=90, Total=650 [2024-11-28 05:06:26,540 INFO L435 NwaCegarLoop]: 1046 mSDtfsCounter, 1533 mSDsluCounter, 11207 mSDsCounter, 0 mSdLazyCounter, 7185 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 12253 SdHoareTripleChecker+Invalid, 7210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 7185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:26,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 12253 Invalid, 7210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 7185 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-28 05:06:26,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-28 05:06:26,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1512. [2024-11-28 05:06:26,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1035 states have (on average 1.6772946859903382) internal successors, (1736), 1500 states have internal predecessors, (1736), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 05:06:26,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1761 transitions. [2024-11-28 05:06:26,567 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1761 transitions. Word has length 90 [2024-11-28 05:06:26,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:26,570 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 1761 transitions. [2024-11-28 05:06:26,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.214285714285714) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:06:26,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1761 transitions. [2024-11-28 05:06:26,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-28 05:06:26,571 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:26,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:26,584 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 05:06:26,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:26,772 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:06:26,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:26,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1711183183, now seen corresponding path program 1 times [2024-11-28 05:06:26,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:26,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185695462] [2024-11-28 05:06:26,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:26,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:27,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:27,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:27,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185695462] [2024-11-28 05:06:27,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185695462] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:06:27,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973711508] [2024-11-28 05:06:27,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:27,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:27,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:06:27,739 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:06:27,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 05:06:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:28,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-28 05:06:28,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:06:28,081 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:06:28,231 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:06:28,231 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:06:28,245 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:06:28,260 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 13 treesize of output 9 [2024-11-28 05:06:28,270 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 1 [2024-11-28 05:06:28,354 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 22 treesize of output 10 [2024-11-28 05:06:28,360 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 9 treesize of output 3 [2024-11-28 05:06:28,495 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:06:28,496 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 62 treesize of output 57 [2024-11-28 05:06:28,503 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 30 treesize of output 13 [2024-11-28 05:06:28,608 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:06:28,608 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 62 treesize of output 57 [2024-11-28 05:06:28,615 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 30 treesize of output 13 [2024-11-28 05:06:28,645 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 31 treesize of output 13 [2024-11-28 05:06:28,651 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 9 treesize of output 3 [2024-11-28 05:06:28,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:28,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:06:28,734 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1070 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1070 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1071) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 05:06:28,747 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1070 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1071) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1070 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2024-11-28 05:06:28,814 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1077 (Array Int Int)) (v_ArrVal_1076 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1076))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1077) .cse0 v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1071) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1070 (Array Int Int)) (v_ArrVal_1077 (Array Int Int)) (v_ArrVal_1076 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1077) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-28 05:06:28,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973711508] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:06:28,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:06:28,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2024-11-28 05:06:28,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291800435] [2024-11-28 05:06:28,818 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:06:28,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 05:06:28,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:06:28,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 05:06:28,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=256, Unknown=3, NotChecked=102, Total=420 [2024-11-28 05:06:28,820 INFO L87 Difference]: Start difference. First operand 1512 states and 1761 transitions. Second operand has 16 states, 14 states have (on average 9.571428571428571) internal successors, (134), 16 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 05:06:34,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:34,033 INFO L93 Difference]: Finished difference Result 1514 states and 1768 transitions. [2024-11-28 05:06:34,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 05:06:34,034 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.571428571428571) internal successors, (134), 16 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 90 [2024-11-28 05:06:34,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:34,042 INFO L225 Difference]: With dead ends: 1514 [2024-11-28 05:06:34,042 INFO L226 Difference]: Without dead ends: 1514 [2024-11-28 05:06:34,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=420, Unknown=3, NotChecked=132, Total=650 [2024-11-28 05:06:34,044 INFO L435 NwaCegarLoop]: 1051 mSDtfsCounter, 1540 mSDsluCounter, 6854 mSDsCounter, 0 mSdLazyCounter, 6710 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1555 SdHoareTripleChecker+Valid, 7905 SdHoareTripleChecker+Invalid, 6749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 6710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:34,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1555 Valid, 7905 Invalid, 6749 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [39 Valid, 6710 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-28 05:06:34,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2024-11-28 05:06:34,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1502. [2024-11-28 05:06:34,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1027 states have (on average 1.6806231742940603) internal successors, (1726), 1491 states have internal predecessors, (1726), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 05:06:34,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1750 transitions. [2024-11-28 05:06:34,066 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1750 transitions. Word has length 90 [2024-11-28 05:06:34,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:34,067 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 1750 transitions. [2024-11-28 05:06:34,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.571428571428571) internal successors, (134), 16 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 05:06:34,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1750 transitions. [2024-11-28 05:06:34,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-28 05:06:34,068 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:34,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:34,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 05:06:34,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-28 05:06:34,273 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:06:34,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:34,273 INFO L85 PathProgramCache]: Analyzing trace with hash 497879810, now seen corresponding path program 1 times [2024-11-28 05:06:34,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:34,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332041194] [2024-11-28 05:06:34,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:34,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:34,985 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:06:34,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:34,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332041194] [2024-11-28 05:06:34,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332041194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:34,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:34,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 05:06:34,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93298013] [2024-11-28 05:06:34,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:34,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 05:06:34,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:06:34,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 05:06:34,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-28 05:06:34,987 INFO L87 Difference]: Start difference. First operand 1502 states and 1750 transitions. Second operand has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:06:39,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:39,138 INFO L93 Difference]: Finished difference Result 1518 states and 1772 transitions. [2024-11-28 05:06:39,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 05:06:39,144 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-28 05:06:39,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:39,149 INFO L225 Difference]: With dead ends: 1518 [2024-11-28 05:06:39,150 INFO L226 Difference]: Without dead ends: 1518 [2024-11-28 05:06:39,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-28 05:06:39,154 INFO L435 NwaCegarLoop]: 1045 mSDtfsCounter, 1565 mSDsluCounter, 10228 mSDsCounter, 0 mSdLazyCounter, 6584 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 11273 SdHoareTripleChecker+Invalid, 6609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 6584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:39,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 11273 Invalid, 6609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 6584 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-28 05:06:39,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-11-28 05:06:39,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1514. [2024-11-28 05:06:39,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1038 states have (on average 1.6753371868978806) internal successors, (1739), 1502 states have internal predecessors, (1739), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 05:06:39,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1764 transitions. [2024-11-28 05:06:39,177 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1764 transitions. Word has length 92 [2024-11-28 05:06:39,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:39,178 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 1764 transitions. [2024-11-28 05:06:39,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:06:39,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1764 transitions. [2024-11-28 05:06:39,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-28 05:06:39,179 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:39,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:39,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 05:06:39,180 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:06:39,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:39,180 INFO L85 PathProgramCache]: Analyzing trace with hash 497879811, now seen corresponding path program 1 times [2024-11-28 05:06:39,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:39,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688322814] [2024-11-28 05:06:39,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:39,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:40,133 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:06:40,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:40,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688322814] [2024-11-28 05:06:40,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688322814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:40,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:40,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 05:06:40,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177480099] [2024-11-28 05:06:40,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:40,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 05:06:40,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:06:40,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 05:06:40,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:06:40,136 INFO L87 Difference]: Start difference. First operand 1514 states and 1764 transitions. Second operand has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:06:44,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:44,588 INFO L93 Difference]: Finished difference Result 1517 states and 1771 transitions. [2024-11-28 05:06:44,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:06:44,589 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-28 05:06:44,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:44,593 INFO L225 Difference]: With dead ends: 1517 [2024-11-28 05:06:44,593 INFO L226 Difference]: Without dead ends: 1517 [2024-11-28 05:06:44,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-28 05:06:44,595 INFO L435 NwaCegarLoop]: 1052 mSDtfsCounter, 1563 mSDsluCounter, 7053 mSDsCounter, 0 mSdLazyCounter, 6441 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 8105 SdHoareTripleChecker+Invalid, 6465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:44,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1578 Valid, 8105 Invalid, 6465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 6441 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-28 05:06:44,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-11-28 05:06:44,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1514. [2024-11-28 05:06:44,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1038 states have (on average 1.674373795761079) internal successors, (1738), 1502 states have internal predecessors, (1738), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 05:06:44,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1763 transitions. [2024-11-28 05:06:44,615 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1763 transitions. Word has length 92 [2024-11-28 05:06:44,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:44,616 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 1763 transitions. [2024-11-28 05:06:44,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:06:44,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1763 transitions. [2024-11-28 05:06:44,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-28 05:06:44,618 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:44,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:44,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 05:06:44,618 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:06:44,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:44,619 INFO L85 PathProgramCache]: Analyzing trace with hash 891975286, now seen corresponding path program 1 times [2024-11-28 05:06:44,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:44,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269840239] [2024-11-28 05:06:44,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:44,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:45,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:45,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269840239] [2024-11-28 05:06:45,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269840239] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:06:45,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255619100] [2024-11-28 05:06:45,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:45,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:45,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:06:45,684 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:06:45,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 05:06:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:46,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-28 05:06:46,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:06:46,053 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:06:46,194 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:06:46,195 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:06:46,206 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 1 [2024-11-28 05:06:46,270 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:06:46,270 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 31 treesize of output 32 [2024-11-28 05:06:46,308 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:06:46,309 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 31 treesize of output 32 [2024-11-28 05:06:46,353 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:06:46,354 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 42 treesize of output 41 [2024-11-28 05:06:46,368 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 31 treesize of output 13 [2024-11-28 05:06:46,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:46,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:06:46,395 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-28 05:06:46,395 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 21 treesize of output 20 [2024-11-28 05:06:46,442 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1359) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse0)))) is different from false [2024-11-28 05:06:46,459 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1358 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1358)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1359) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-28 05:06:46,468 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1358 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1358))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1359) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 05:06:46,506 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1358 (Array Int Int)) (v_ArrVal_1362 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1362))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1358)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1359) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 05:06:46,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255619100] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:06:46,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:06:46,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2024-11-28 05:06:46,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168403699] [2024-11-28 05:06:46,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:06:46,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 05:06:46,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:06:46,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 05:06:46,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=231, Unknown=8, NotChecked=132, Total=420 [2024-11-28 05:06:46,512 INFO L87 Difference]: Start difference. First operand 1514 states and 1763 transitions. Second operand has 16 states, 14 states have (on average 9.571428571428571) internal successors, (134), 16 states have internal predecessors, (134), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:06:49,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:49,938 INFO L93 Difference]: Finished difference Result 1516 states and 1770 transitions. [2024-11-28 05:06:49,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 05:06:49,939 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.571428571428571) internal successors, (134), 16 states have internal predecessors, (134), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-28 05:06:49,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:49,943 INFO L225 Difference]: With dead ends: 1516 [2024-11-28 05:06:49,943 INFO L226 Difference]: Without dead ends: 1516 [2024-11-28 05:06:49,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=464, Unknown=8, NotChecked=188, Total=756 [2024-11-28 05:06:49,944 INFO L435 NwaCegarLoop]: 1051 mSDtfsCounter, 1534 mSDsluCounter, 8204 mSDsCounter, 0 mSdLazyCounter, 5335 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 9255 SdHoareTripleChecker+Invalid, 5360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 5335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:49,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 9255 Invalid, 5360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 5335 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-28 05:06:49,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-11-28 05:06:49,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1513. [2024-11-28 05:06:49,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1038 states have (on average 1.6734104046242775) internal successors, (1737), 1501 states have internal predecessors, (1737), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 05:06:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1762 transitions. [2024-11-28 05:06:49,968 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1762 transitions. Word has length 93 [2024-11-28 05:06:49,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:49,969 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1762 transitions. [2024-11-28 05:06:49,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.571428571428571) internal successors, (134), 16 states have internal predecessors, (134), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:06:49,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1762 transitions. [2024-11-28 05:06:49,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-28 05:06:49,975 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:49,975 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:49,989 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 05:06:50,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-28 05:06:50,176 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:06:50,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:50,177 INFO L85 PathProgramCache]: Analyzing trace with hash 891975287, now seen corresponding path program 1 times [2024-11-28 05:06:50,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:06:50,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978308380] [2024-11-28 05:06:50,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:50,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:06:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:51,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:51,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:06:51,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978308380] [2024-11-28 05:06:51,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978308380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:06:51,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134231620] [2024-11-28 05:06:51,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:51,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:51,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:06:51,525 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:06:51,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 05:06:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:51,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-28 05:06:51,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:06:51,937 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:06:52,087 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:06:52,087 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:06:52,098 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:06:52,114 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 1 [2024-11-28 05:06:52,119 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 13 treesize of output 9 [2024-11-28 05:06:52,192 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 22 treesize of output 10 [2024-11-28 05:06:52,196 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 9 treesize of output 3 [2024-11-28 05:06:52,353 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:06:52,353 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 62 treesize of output 57 [2024-11-28 05:06:52,370 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 30 treesize of output 13 [2024-11-28 05:06:52,479 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:06:52,479 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 62 treesize of output 57 [2024-11-28 05:06:52,489 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 30 treesize of output 13 [2024-11-28 05:06:52,585 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:06:52,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:06:52,592 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 30 treesize of output 13 [2024-11-28 05:06:52,620 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 31 treesize of output 13 [2024-11-28 05:06:52,628 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 9 treesize of output 3 [2024-11-28 05:06:52,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:52,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:06:52,734 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1518 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))))) is different from false [2024-11-28 05:06:52,758 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1518 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) is different from false [2024-11-28 05:06:52,837 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1518 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1516) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1515) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1515))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1516) .cse1 v_ArrVal_1518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-28 05:06:52,893 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1515))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1516) .cse1 v_ArrVal_1518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1518 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1516) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1515) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))) is different from false [2024-11-28 05:06:52,985 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1518 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1524))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1523) .cse0 v_ArrVal_1516) (select (select (store .cse1 .cse0 v_ArrVal_1515) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1518))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1516 (Array Int Int)) (v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1517 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1524))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1515))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1523) .cse3 v_ArrVal_1516) .cse4 v_ArrVal_1518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-28 05:06:52,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134231620] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:06:52,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:06:52,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 17 [2024-11-28 05:06:52,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800513442] [2024-11-28 05:06:52,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:06:52,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 05:06:52,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:06:52,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 05:06:52,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=321, Unknown=5, NotChecked=200, Total=600 [2024-11-28 05:06:52,990 INFO L87 Difference]: Start difference. First operand 1513 states and 1762 transitions. Second operand has 18 states, 16 states have (on average 8.6875) internal successors, (139), 18 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 05:07:00,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:07:00,834 INFO L93 Difference]: Finished difference Result 1515 states and 1769 transitions. [2024-11-28 05:07:00,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 05:07:00,835 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.6875) internal successors, (139), 18 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 93 [2024-11-28 05:07:00,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:07:00,839 INFO L225 Difference]: With dead ends: 1515 [2024-11-28 05:07:00,839 INFO L226 Difference]: Without dead ends: 1515 [2024-11-28 05:07:00,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=119, Invalid=546, Unknown=5, NotChecked=260, Total=930 [2024-11-28 05:07:00,841 INFO L435 NwaCegarLoop]: 1050 mSDtfsCounter, 1533 mSDsluCounter, 10469 mSDsCounter, 0 mSdLazyCounter, 9486 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 11519 SdHoareTripleChecker+Invalid, 9512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 9486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:07:00,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 11519 Invalid, 9512 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 9486 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2024-11-28 05:07:00,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-28 05:07:00,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1500. [2024-11-28 05:07:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1027 states have (on average 1.6786757546251216) internal successors, (1724), 1489 states have internal predecessors, (1724), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 05:07:00,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1748 transitions. [2024-11-28 05:07:00,862 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1748 transitions. Word has length 93 [2024-11-28 05:07:00,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:07:00,863 INFO L471 AbstractCegarLoop]: Abstraction has 1500 states and 1748 transitions. [2024-11-28 05:07:00,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.6875) internal successors, (139), 18 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 05:07:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1748 transitions. [2024-11-28 05:07:00,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-28 05:07:00,864 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:07:00,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:00,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-28 05:07:01,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-28 05:07:01,065 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:07:01,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:07:01,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1815990121, now seen corresponding path program 1 times [2024-11-28 05:07:01,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:07:01,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586411773] [2024-11-28 05:07:01,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:07:01,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:07:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:07:01,943 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:07:01,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:07:01,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586411773] [2024-11-28 05:07:01,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586411773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:07:01,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:07:01,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 05:07:01,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174935569] [2024-11-28 05:07:01,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:07:01,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 05:07:01,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:07:01,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 05:07:01,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-28 05:07:01,945 INFO L87 Difference]: Start difference. First operand 1500 states and 1748 transitions. Second operand has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:07:06,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:07:06,741 INFO L93 Difference]: Finished difference Result 1519 states and 1773 transitions. [2024-11-28 05:07:06,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 05:07:06,742 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-28 05:07:06,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:07:06,745 INFO L225 Difference]: With dead ends: 1519 [2024-11-28 05:07:06,745 INFO L226 Difference]: Without dead ends: 1519 [2024-11-28 05:07:06,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2024-11-28 05:07:06,747 INFO L435 NwaCegarLoop]: 1044 mSDtfsCounter, 1566 mSDsluCounter, 11198 mSDsCounter, 0 mSdLazyCounter, 7173 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1581 SdHoareTripleChecker+Valid, 12242 SdHoareTripleChecker+Invalid, 7198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 7173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:07:06,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1581 Valid, 12242 Invalid, 7198 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 7173 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-28 05:07:06,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2024-11-28 05:07:06,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1515. [2024-11-28 05:07:06,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1041 states have (on average 1.6714697406340058) internal successors, (1740), 1503 states have internal predecessors, (1740), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 05:07:06,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1765 transitions. [2024-11-28 05:07:06,770 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1765 transitions. Word has length 95 [2024-11-28 05:07:06,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:07:06,770 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 1765 transitions. [2024-11-28 05:07:06,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:07:06,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1765 transitions. [2024-11-28 05:07:06,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-28 05:07:06,772 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:07:06,773 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:06,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 05:07:06,774 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:07:06,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:07:06,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1815990122, now seen corresponding path program 1 times [2024-11-28 05:07:06,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:07:06,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827703286] [2024-11-28 05:07:06,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:07:06,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:07:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:07:08,141 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:07:08,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:07:08,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827703286] [2024-11-28 05:07:08,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827703286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:07:08,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:07:08,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 05:07:08,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636646349] [2024-11-28 05:07:08,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:07:08,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 05:07:08,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:07:08,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 05:07:08,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-28 05:07:08,143 INFO L87 Difference]: Start difference. First operand 1515 states and 1765 transitions. Second operand has 13 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:07:12,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:07:12,262 INFO L93 Difference]: Finished difference Result 1518 states and 1772 transitions. [2024-11-28 05:07:12,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 05:07:12,262 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-28 05:07:12,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:07:12,266 INFO L225 Difference]: With dead ends: 1518 [2024-11-28 05:07:12,267 INFO L226 Difference]: Without dead ends: 1518 [2024-11-28 05:07:12,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-28 05:07:12,268 INFO L435 NwaCegarLoop]: 1051 mSDtfsCounter, 1565 mSDsluCounter, 5265 mSDsCounter, 0 mSdLazyCounter, 5053 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 6316 SdHoareTripleChecker+Invalid, 5077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:07:12,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 6316 Invalid, 5077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5053 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-28 05:07:12,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-11-28 05:07:12,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1515. [2024-11-28 05:07:12,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1041 states have (on average 1.670509125840538) internal successors, (1739), 1503 states have internal predecessors, (1739), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 05:07:12,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1764 transitions. [2024-11-28 05:07:12,295 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1764 transitions. Word has length 95 [2024-11-28 05:07:12,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:07:12,295 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 1764 transitions. [2024-11-28 05:07:12,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:07:12,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1764 transitions. [2024-11-28 05:07:12,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 05:07:12,297 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:07:12,297 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:12,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 05:07:12,298 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:07:12,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:07:12,298 INFO L85 PathProgramCache]: Analyzing trace with hash -126271627, now seen corresponding path program 1 times [2024-11-28 05:07:12,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:07:12,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724359168] [2024-11-28 05:07:12,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:07:12,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:07:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:07:13,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:07:13,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:07:13,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724359168] [2024-11-28 05:07:13,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724359168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:07:13,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570009059] [2024-11-28 05:07:13,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:07:13,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:07:13,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:07:13,302 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:07:13,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 05:07:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:07:13,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-28 05:07:13,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:07:13,723 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:07:13,875 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:07:13,875 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:07:13,884 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 1 [2024-11-28 05:07:13,997 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:07:13,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 42 treesize of output 41 [2024-11-28 05:07:14,074 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:07:14,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 42 treesize of output 41 [2024-11-28 05:07:14,139 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:07:14,139 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 42 treesize of output 41 [2024-11-28 05:07:14,211 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:07:14,211 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 42 treesize of output 41 [2024-11-28 05:07:14,233 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 31 treesize of output 13 [2024-11-28 05:07:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:07:14,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:07:14,249 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1831 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1831) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-28 05:07:14,256 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1831 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1831) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-28 05:07:14,374 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1829 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1829))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1830)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1831)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 05:07:14,506 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-28 05:07:14,506 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 105 treesize of output 104 [2024-11-28 05:07:14,517 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1829 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1834))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1829)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1830)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1831)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-28 05:07:14,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570009059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:07:14,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:07:14,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 20 [2024-11-28 05:07:14,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431260186] [2024-11-28 05:07:14,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:07:14,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 05:07:14,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:07:14,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 05:07:14,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=445, Unknown=31, NotChecked=188, Total=756 [2024-11-28 05:07:14,522 INFO L87 Difference]: Start difference. First operand 1515 states and 1764 transitions. Second operand has 21 states, 19 states have (on average 7.631578947368421) internal successors, (145), 21 states have internal predecessors, (145), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 05:07:20,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:07:20,525 INFO L93 Difference]: Finished difference Result 1517 states and 1771 transitions. [2024-11-28 05:07:20,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 05:07:20,525 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.631578947368421) internal successors, (145), 21 states have internal predecessors, (145), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2024-11-28 05:07:20,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:07:20,529 INFO L225 Difference]: With dead ends: 1517 [2024-11-28 05:07:20,529 INFO L226 Difference]: Without dead ends: 1517 [2024-11-28 05:07:20,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=175, Invalid=859, Unknown=38, NotChecked=260, Total=1332 [2024-11-28 05:07:20,531 INFO L435 NwaCegarLoop]: 1044 mSDtfsCounter, 1531 mSDsluCounter, 14258 mSDsCounter, 0 mSdLazyCounter, 8909 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 15302 SdHoareTripleChecker+Invalid, 8935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 8909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:07:20,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 15302 Invalid, 8935 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 8909 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-28 05:07:20,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-11-28 05:07:20,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1514. [2024-11-28 05:07:20,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1041 states have (on average 1.66954851104707) internal successors, (1738), 1502 states have internal predecessors, (1738), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 05:07:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1763 transitions. [2024-11-28 05:07:20,558 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1763 transitions. Word has length 96 [2024-11-28 05:07:20,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:07:20,559 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 1763 transitions. [2024-11-28 05:07:20,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.631578947368421) internal successors, (145), 21 states have internal predecessors, (145), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 05:07:20,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1763 transitions. [2024-11-28 05:07:20,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 05:07:20,560 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:07:20,560 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:20,573 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 05:07:20,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-28 05:07:20,762 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:07:20,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:07:20,762 INFO L85 PathProgramCache]: Analyzing trace with hash -126271626, now seen corresponding path program 1 times [2024-11-28 05:07:20,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:07:20,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364000331] [2024-11-28 05:07:20,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:07:20,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:07:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:07:21,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:07:21,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:07:21,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364000331] [2024-11-28 05:07:21,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364000331] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:07:21,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368516360] [2024-11-28 05:07:21,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:07:21,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:07:21,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:07:21,921 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:07:21,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 05:07:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:07:22,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-28 05:07:22,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:07:22,345 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:07:22,490 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:07:22,491 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:07:22,498 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:07:22,531 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 1 [2024-11-28 05:07:22,538 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 13 treesize of output 9 [2024-11-28 05:07:22,661 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 22 treesize of output 10 [2024-11-28 05:07:22,666 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 9 treesize of output 3 [2024-11-28 05:07:22,808 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:07:22,808 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 62 treesize of output 57 [2024-11-28 05:07:22,818 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 30 treesize of output 13 [2024-11-28 05:07:22,938 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:07:22,938 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 62 treesize of output 57 [2024-11-28 05:07:22,946 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 30 treesize of output 13 [2024-11-28 05:07:23,027 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:07:23,028 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 62 treesize of output 57 [2024-11-28 05:07:23,033 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 30 treesize of output 13 [2024-11-28 05:07:23,125 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:07:23,125 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 62 treesize of output 57 [2024-11-28 05:07:23,131 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 30 treesize of output 13 [2024-11-28 05:07:23,156 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 31 treesize of output 13 [2024-11-28 05:07:23,167 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 9 treesize of output 3 [2024-11-28 05:07:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:07:23,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:07:23,301 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2004 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 05:07:23,405 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2002) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2001))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2002) .cse1 v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-28 05:07:23,427 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2001))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2002) .cse1 v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2002) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-28 05:07:23,467 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1999))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2001))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2000) .cse0 v_ArrVal_2002) .cse1 v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1999))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2000) .cse5 v_ArrVal_2002) (select (select (store .cse6 .cse5 v_ArrVal_2001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2004))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2024-11-28 05:07:23,776 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2009 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2003 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int)) (v_ArrVal_2010 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2010))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_1999))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2001))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2009) .cse0 v_ArrVal_2000) .cse1 v_ArrVal_2002) .cse2 v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2009 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2002 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int)) (v_ArrVal_2010 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2010))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_1999))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2009) .cse7 v_ArrVal_2000) .cse8 v_ArrVal_2002) (select (select (store .cse9 .cse8 v_ArrVal_2001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2004))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2024-11-28 05:07:23,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368516360] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:07:23,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:07:23,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-11-28 05:07:23,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265326236] [2024-11-28 05:07:23,780 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:07:23,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 05:07:23,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:07:23,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 05:07:23,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=635, Unknown=21, NotChecked=280, Total=1056 [2024-11-28 05:07:23,782 INFO L87 Difference]: Start difference. First operand 1514 states and 1763 transitions. Second operand has 24 states, 21 states have (on average 7.333333333333333) internal successors, (154), 24 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:07:31,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:07:31,312 INFO L93 Difference]: Finished difference Result 1516 states and 1770 transitions. [2024-11-28 05:07:31,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 05:07:31,313 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.333333333333333) internal successors, (154), 24 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2024-11-28 05:07:31,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:07:31,316 INFO L225 Difference]: With dead ends: 1516 [2024-11-28 05:07:31,316 INFO L226 Difference]: Without dead ends: 1516 [2024-11-28 05:07:31,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=195, Invalid=994, Unknown=21, NotChecked=350, Total=1560 [2024-11-28 05:07:31,318 INFO L435 NwaCegarLoop]: 1049 mSDtfsCounter, 1533 mSDsluCounter, 9493 mSDsCounter, 0 mSdLazyCounter, 8909 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 10542 SdHoareTripleChecker+Invalid, 8936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 8909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:07:31,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 10542 Invalid, 8936 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 8909 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-28 05:07:31,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-11-28 05:07:31,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1498. [2024-11-28 05:07:31,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1027 states have (on average 1.676728334956183) internal successors, (1722), 1487 states have internal predecessors, (1722), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 05:07:31,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1746 transitions. [2024-11-28 05:07:31,337 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 1746 transitions. Word has length 96 [2024-11-28 05:07:31,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:07:31,338 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 1746 transitions. [2024-11-28 05:07:31,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.333333333333333) internal successors, (154), 24 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:07:31,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1746 transitions. [2024-11-28 05:07:31,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-28 05:07:31,339 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:07:31,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:31,353 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-28 05:07:31,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-28 05:07:31,540 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:07:31,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:07:31,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1907991275, now seen corresponding path program 1 times [2024-11-28 05:07:31,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:07:31,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102819550] [2024-11-28 05:07:31,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:07:31,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:07:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:07:32,445 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:07:32,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:07:32,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102819550] [2024-11-28 05:07:32,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102819550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:07:32,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:07:32,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 05:07:32,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804605886] [2024-11-28 05:07:32,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:07:32,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 05:07:32,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:07:32,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 05:07:32,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-28 05:07:32,447 INFO L87 Difference]: Start difference. First operand 1498 states and 1746 transitions. Second operand has 14 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:07:35,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:07:35,354 INFO L93 Difference]: Finished difference Result 1521 states and 1775 transitions. [2024-11-28 05:07:35,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:07:35,355 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-28 05:07:35,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:07:35,357 INFO L225 Difference]: With dead ends: 1521 [2024-11-28 05:07:35,357 INFO L226 Difference]: Without dead ends: 1521 [2024-11-28 05:07:35,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2024-11-28 05:07:35,358 INFO L435 NwaCegarLoop]: 1049 mSDtfsCounter, 1569 mSDsluCounter, 6095 mSDsCounter, 0 mSdLazyCounter, 4200 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1584 SdHoareTripleChecker+Valid, 7144 SdHoareTripleChecker+Invalid, 4227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 4200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:07:35,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1584 Valid, 7144 Invalid, 4227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 4200 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-28 05:07:35,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2024-11-28 05:07:35,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1517. [2024-11-28 05:07:35,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1045 states have (on average 1.6669856459330143) internal successors, (1742), 1505 states have internal predecessors, (1742), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 05:07:35,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1767 transitions. [2024-11-28 05:07:35,375 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 1767 transitions. Word has length 99 [2024-11-28 05:07:35,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:07:35,375 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 1767 transitions. [2024-11-28 05:07:35,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:07:35,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1767 transitions. [2024-11-28 05:07:35,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-28 05:07:35,376 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:07:35,376 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:35,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-28 05:07:35,376 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:07:35,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:07:35,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1907991276, now seen corresponding path program 1 times [2024-11-28 05:07:35,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:07:35,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340487716] [2024-11-28 05:07:35,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:07:35,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:07:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:07:37,013 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:07:37,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:07:37,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340487716] [2024-11-28 05:07:37,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340487716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:07:37,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:07:37,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 05:07:37,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020126208] [2024-11-28 05:07:37,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:07:37,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 05:07:37,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:07:37,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 05:07:37,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-28 05:07:37,016 INFO L87 Difference]: Start difference. First operand 1517 states and 1767 transitions. Second operand has 15 states, 14 states have (on average 6.928571428571429) internal successors, (97), 15 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:07:43,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:07:43,353 INFO L93 Difference]: Finished difference Result 1520 states and 1774 transitions. [2024-11-28 05:07:43,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 05:07:43,354 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.928571428571429) internal successors, (97), 15 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-28 05:07:43,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:07:43,356 INFO L225 Difference]: With dead ends: 1520 [2024-11-28 05:07:43,356 INFO L226 Difference]: Without dead ends: 1520 [2024-11-28 05:07:43,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2024-11-28 05:07:43,357 INFO L435 NwaCegarLoop]: 1050 mSDtfsCounter, 1548 mSDsluCounter, 8667 mSDsCounter, 0 mSdLazyCounter, 8079 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1563 SdHoareTripleChecker+Valid, 9717 SdHoareTripleChecker+Invalid, 8104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 8079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:07:43,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1563 Valid, 9717 Invalid, 8104 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 8079 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-28 05:07:43,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2024-11-28 05:07:43,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1517. [2024-11-28 05:07:43,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1045 states have (on average 1.6660287081339713) internal successors, (1741), 1505 states have internal predecessors, (1741), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 05:07:43,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1766 transitions. [2024-11-28 05:07:43,378 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 1766 transitions. Word has length 99 [2024-11-28 05:07:43,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:07:43,379 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 1766 transitions. [2024-11-28 05:07:43,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.928571428571429) internal successors, (97), 15 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:07:43,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1766 transitions. [2024-11-28 05:07:43,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-28 05:07:43,380 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:07:43,380 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:43,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-28 05:07:43,381 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:07:43,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:07:43,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1822020361, now seen corresponding path program 1 times [2024-11-28 05:07:43,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:07:43,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742587349] [2024-11-28 05:07:43,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:07:43,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:07:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:07:44,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:07:44,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:07:44,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742587349] [2024-11-28 05:07:44,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742587349] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:07:44,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638915573] [2024-11-28 05:07:44,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:07:44,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:07:44,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:07:44,448 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:07:44,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 05:07:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:07:44,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-28 05:07:44,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:07:44,883 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:07:45,007 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:07:45,008 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:07:45,017 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 1 [2024-11-28 05:07:45,141 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:07:45,141 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 42 treesize of output 41 [2024-11-28 05:07:45,200 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:07:45,200 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 42 treesize of output 41 [2024-11-28 05:07:45,275 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:07:45,275 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 42 treesize of output 41 [2024-11-28 05:07:45,332 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:07:45,333 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 42 treesize of output 41 [2024-11-28 05:07:45,402 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:07:45,402 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 42 treesize of output 41 [2024-11-28 05:07:45,418 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 31 treesize of output 13 [2024-11-28 05:07:45,450 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 05:07:45,450 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 16 [2024-11-28 05:07:45,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:07:45,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:07:46,542 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-28 05:07:46,542 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 597 treesize of output 794 [2024-11-28 05:07:46,582 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2347 (Array Int Int)) (v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2354))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2347)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2348)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2349)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2350)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-28 05:07:46,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638915573] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:07:46,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:07:46,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 23 [2024-11-28 05:07:46,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137876001] [2024-11-28 05:07:46,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:07:46,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 05:07:46,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:07:46,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 05:07:46,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=929, Unknown=48, NotChecked=64, Total=1190 [2024-11-28 05:07:46,586 INFO L87 Difference]: Start difference. First operand 1517 states and 1766 transitions. Second operand has 24 states, 21 states have (on average 7.238095238095238) internal successors, (152), 24 states have internal predecessors, (152), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:07:52,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:07:52,903 INFO L93 Difference]: Finished difference Result 1519 states and 1773 transitions. [2024-11-28 05:07:52,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 05:07:52,903 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.238095238095238) internal successors, (152), 24 states have internal predecessors, (152), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 100 [2024-11-28 05:07:52,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:07:52,905 INFO L225 Difference]: With dead ends: 1519 [2024-11-28 05:07:52,905 INFO L226 Difference]: Without dead ends: 1519 [2024-11-28 05:07:52,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=271, Invalid=1577, Unknown=48, NotChecked=84, Total=1980 [2024-11-28 05:07:52,906 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 1533 mSDsluCounter, 14288 mSDsCounter, 0 mSdLazyCounter, 8956 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 15331 SdHoareTripleChecker+Invalid, 8995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 8956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:07:52,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 15331 Invalid, 8995 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [39 Valid, 8956 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-28 05:07:52,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2024-11-28 05:07:52,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1516. [2024-11-28 05:07:52,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1516 states, 1045 states have (on average 1.6650717703349283) internal successors, (1740), 1504 states have internal predecessors, (1740), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 05:07:52,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 1765 transitions. [2024-11-28 05:07:52,931 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 1765 transitions. Word has length 100 [2024-11-28 05:07:52,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:07:52,931 INFO L471 AbstractCegarLoop]: Abstraction has 1516 states and 1765 transitions. [2024-11-28 05:07:52,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.238095238095238) internal successors, (152), 24 states have internal predecessors, (152), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:07:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 1765 transitions. [2024-11-28 05:07:52,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-28 05:07:52,932 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:07:52,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:52,944 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 05:07:53,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:07:53,134 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:07:53,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:07:53,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1822020360, now seen corresponding path program 1 times [2024-11-28 05:07:53,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:07:53,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000852627] [2024-11-28 05:07:53,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:07:53,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:07:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:07:54,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:07:54,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:07:54,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000852627] [2024-11-28 05:07:54,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000852627] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:07:54,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551036295] [2024-11-28 05:07:54,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:07:54,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:07:54,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:07:54,790 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:07:54,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 05:07:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:07:55,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-28 05:07:55,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:07:55,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:07:55,279 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:07:55,289 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:07:55,290 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:07:55,301 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 1 [2024-11-28 05:07:55,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 13 treesize of output 9 [2024-11-28 05:07:55,380 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 22 treesize of output 10 [2024-11-28 05:07:55,384 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 9 treesize of output 3 [2024-11-28 05:07:55,595 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:07:55,595 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 73 treesize of output 66 [2024-11-28 05:07:55,603 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 30 treesize of output 13 [2024-11-28 05:07:55,703 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:07:55,703 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 73 treesize of output 66 [2024-11-28 05:07:55,710 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 30 treesize of output 13 [2024-11-28 05:07:55,799 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:07:55,800 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 73 treesize of output 66 [2024-11-28 05:07:55,804 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 30 treesize of output 13 [2024-11-28 05:07:55,913 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:07:55,914 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 73 treesize of output 66 [2024-11-28 05:07:55,918 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 30 treesize of output 13 [2024-11-28 05:07:56,001 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:07:56,002 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 73 treesize of output 66 [2024-11-28 05:07:56,011 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 30 treesize of output 13 [2024-11-28 05:07:56,034 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 42 treesize of output 18 [2024-11-28 05:07:56,044 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 9 treesize of output 3 [2024-11-28 05:07:56,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:07:56,058 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:07:56,068 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:07:56,068 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:07:56,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:07:56,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:07:57,007 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))) (forall ((v_ArrVal_2539 (Array Int Int)) (v_ArrVal_2538 (Array Int Int)) (v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2542 (Array Int Int)) (v_ArrVal_2540 (Array Int Int))) (< 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2537))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2538) .cse0 v_ArrVal_2540) (select (select (store .cse1 .cse0 v_ArrVal_2539) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2542))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)))) (forall ((v_ArrVal_2539 (Array Int Int)) (v_ArrVal_2538 (Array Int Int)) (v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2542 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2540 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)) (forall ((v_ArrVal_2543 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2537))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2539))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2538) .cse3 v_ArrVal_2540) .cse4 v_ArrVal_2542) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2543) (select (select (store .cse5 .cse4 v_ArrVal_2541) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))))) is different from false [2024-11-28 05:07:58,102 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((v_ArrVal_2539 (Array Int Int)) (v_ArrVal_2538 (Array Int Int)) (v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2542 (Array Int Int)) (v_ArrVal_2540 (Array Int Int))) (< 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2535))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2537))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2536) .cse1 v_ArrVal_2538) .cse2 v_ArrVal_2540) (select (select (store .cse3 .cse2 v_ArrVal_2539) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2542))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))) (forall ((v_ArrVal_2539 (Array Int Int)) (v_ArrVal_2538 (Array Int Int)) (v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2542 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2540 (Array Int Int))) (or (forall ((v_ArrVal_2543 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2535))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2537))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2539))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2536) .cse6 v_ArrVal_2538) .cse7 v_ArrVal_2540) .cse8 v_ArrVal_2542) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2543) (select (select (store .cse9 .cse8 v_ArrVal_2541) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))))))) is different from false [2024-11-28 05:07:58,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:07:58,235 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 604 treesize of output 622 [2024-11-28 05:07:58,859 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2539 (Array Int Int)) (v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2538 (Array Int Int)) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2542 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2543 Int) (v_ArrVal_2540 (Array Int Int))) (or (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2548))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_2535))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2537))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_2539))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 3 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2549) .cse0 v_ArrVal_2536) .cse1 v_ArrVal_2538) .cse2 v_ArrVal_2540) .cse3 v_ArrVal_2542) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2543) (select (select (store .cse5 .cse3 v_ArrVal_2541) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_7| |c_ULTIMATE.start_main_#t~mem50#1.base|))) (forall ((v_ArrVal_2539 (Array Int Int)) (v_ArrVal_2549 (Array Int Int)) (v_ArrVal_2538 (Array Int Int)) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2542 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2543 Int) (v_ArrVal_2540 (Array Int Int))) (or (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2548))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_2535))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_2537))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_2539))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 3 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2549) .cse9 v_ArrVal_2536) .cse10 v_ArrVal_2538) .cse11 v_ArrVal_2540) .cse12 v_ArrVal_2542) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2543) (select (select (store .cse13 .cse12 v_ArrVal_2541) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_7| |c_ULTIMATE.start_main_#t~mem50#1.base|))) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_26 (Array Int Int))) (< 0 (+ (select (select (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_20))) (let ((.cse17 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse21 (store .cse22 .cse17 v_prenex_23))) (let ((.cse18 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse20 (store .cse21 .cse18 v_prenex_21))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_18) .cse17 v_prenex_22) .cse18 v_prenex_19) .cse19 v_prenex_26) (select (select (store .cse20 .cse19 v_prenex_17) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_24))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))))) is different from false [2024-11-28 05:07:58,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551036295] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:07:58,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:07:58,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 25 [2024-11-28 05:07:58,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128670978] [2024-11-28 05:07:58,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:07:58,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 05:07:58,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:07:58,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 05:07:58,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1007, Unknown=38, NotChecked=204, Total=1406 [2024-11-28 05:07:58,868 INFO L87 Difference]: Start difference. First operand 1516 states and 1765 transitions. Second operand has 26 states, 24 states have (on average 6.25) internal successors, (150), 24 states have internal predecessors, (150), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 05:08:14,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:14,710 INFO L93 Difference]: Finished difference Result 1518 states and 1772 transitions. [2024-11-28 05:08:14,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 05:08:14,711 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.25) internal successors, (150), 24 states have internal predecessors, (150), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2024-11-28 05:08:14,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:14,712 INFO L225 Difference]: With dead ends: 1518 [2024-11-28 05:08:14,712 INFO L226 Difference]: Without dead ends: 1518 [2024-11-28 05:08:14,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=271, Invalid=1683, Unknown=38, NotChecked=264, Total=2256 [2024-11-28 05:08:14,713 INFO L435 NwaCegarLoop]: 1042 mSDtfsCounter, 1528 mSDsluCounter, 11227 mSDsCounter, 0 mSdLazyCounter, 10366 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1543 SdHoareTripleChecker+Valid, 12269 SdHoareTripleChecker+Invalid, 10396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 10366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:14,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1543 Valid, 12269 Invalid, 10396 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 10366 Invalid, 0 Unknown, 0 Unchecked, 15.1s Time] [2024-11-28 05:08:14,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-11-28 05:08:14,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1496. [2024-11-28 05:08:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1496 states, 1027 states have (on average 1.6747809152872444) internal successors, (1720), 1485 states have internal predecessors, (1720), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 05:08:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1744 transitions. [2024-11-28 05:08:14,735 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 1744 transitions. Word has length 100 [2024-11-28 05:08:14,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:14,735 INFO L471 AbstractCegarLoop]: Abstraction has 1496 states and 1744 transitions. [2024-11-28 05:08:14,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.25) internal successors, (150), 24 states have internal predecessors, (150), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 05:08:14,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1744 transitions. [2024-11-28 05:08:14,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-28 05:08:14,736 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:14,736 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-28 05:08:14,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-28 05:08:14,937 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:08:14,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:14,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1371536655, now seen corresponding path program 1 times [2024-11-28 05:08:14,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:14,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654091514] [2024-11-28 05:08:14,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:14,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:15,958 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:15,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:15,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654091514] [2024-11-28 05:08:15,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654091514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:08:15,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:08:15,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 05:08:15,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170970935] [2024-11-28 05:08:15,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:08:15,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 05:08:15,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:15,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 05:08:15,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-28 05:08:15,962 INFO L87 Difference]: Start difference. First operand 1496 states and 1744 transitions. Second operand has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:08:26,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:26,153 INFO L93 Difference]: Finished difference Result 1522 states and 1776 transitions. [2024-11-28 05:08:26,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 05:08:26,154 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-11-28 05:08:26,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:26,155 INFO L225 Difference]: With dead ends: 1522 [2024-11-28 05:08:26,155 INFO L226 Difference]: Without dead ends: 1522 [2024-11-28 05:08:26,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2024-11-28 05:08:26,156 INFO L435 NwaCegarLoop]: 1048 mSDtfsCounter, 1551 mSDsluCounter, 11243 mSDsCounter, 0 mSdLazyCounter, 7106 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1566 SdHoareTripleChecker+Valid, 12291 SdHoareTripleChecker+Invalid, 7131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 7106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:26,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1566 Valid, 12291 Invalid, 7131 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 7106 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2024-11-28 05:08:26,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2024-11-28 05:08:26,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1518. [2024-11-28 05:08:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1048 states have (on average 1.6631679389312977) internal successors, (1743), 1506 states have internal predecessors, (1743), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 05:08:26,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1768 transitions. [2024-11-28 05:08:26,174 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1768 transitions. Word has length 102 [2024-11-28 05:08:26,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:26,175 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 1768 transitions. [2024-11-28 05:08:26,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:08:26,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1768 transitions. [2024-11-28 05:08:26,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-28 05:08:26,176 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:26,176 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-28 05:08:26,177 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:08:26,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:26,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1371536656, now seen corresponding path program 1 times [2024-11-28 05:08:26,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:26,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76675069] [2024-11-28 05:08:26,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:26,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:28,192 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:28,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:28,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76675069] [2024-11-28 05:08:28,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76675069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:08:28,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:08:28,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 05:08:28,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719866996] [2024-11-28 05:08:28,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:08:28,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 05:08:28,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:28,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 05:08:28,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-28 05:08:28,196 INFO L87 Difference]: Start difference. First operand 1518 states and 1768 transitions. Second operand has 19 states, 17 states have (on average 5.882352941176471) internal successors, (100), 18 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:08:37,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:37,147 INFO L93 Difference]: Finished difference Result 1521 states and 1775 transitions. [2024-11-28 05:08:37,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 05:08:37,147 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.882352941176471) internal successors, (100), 18 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-11-28 05:08:37,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:37,149 INFO L225 Difference]: With dead ends: 1521 [2024-11-28 05:08:37,149 INFO L226 Difference]: Without dead ends: 1521 [2024-11-28 05:08:37,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-11-28 05:08:37,150 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 1550 mSDsluCounter, 6486 mSDsCounter, 0 mSdLazyCounter, 5503 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1565 SdHoareTripleChecker+Valid, 7529 SdHoareTripleChecker+Invalid, 5531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 5503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:37,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1565 Valid, 7529 Invalid, 5531 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 5503 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2024-11-28 05:08:37,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2024-11-28 05:08:37,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1518. [2024-11-28 05:08:37,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1048 states have (on average 1.6622137404580153) internal successors, (1742), 1506 states have internal predecessors, (1742), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 05:08:37,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1767 transitions. [2024-11-28 05:08:37,172 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1767 transitions. Word has length 102 [2024-11-28 05:08:37,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:37,173 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 1767 transitions. [2024-11-28 05:08:37,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.882352941176471) internal successors, (100), 18 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:08:37,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1767 transitions. [2024-11-28 05:08:37,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-28 05:08:37,174 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:37,174 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-28 05:08:37,174 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:08:37,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:37,174 INFO L85 PathProgramCache]: Analyzing trace with hash -11229309, now seen corresponding path program 1 times [2024-11-28 05:08:37,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:37,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925021123] [2024-11-28 05:08:37,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:37,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:38,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:38,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:38,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925021123] [2024-11-28 05:08:38,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925021123] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:08:38,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243392528] [2024-11-28 05:08:38,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:38,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:08:38,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:08:38,273 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:08:38,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 05:08:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:38,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-28 05:08:38,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:08:38,757 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:38,984 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:08:38,984 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:38,994 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 1 [2024-11-28 05:08:39,096 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:08:39,097 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 31 treesize of output 32 [2024-11-28 05:08:39,203 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:08:39,203 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 31 treesize of output 32 [2024-11-28 05:08:39,290 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:08:39,291 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 31 treesize of output 32 [2024-11-28 05:08:39,377 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:08:39,377 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 31 treesize of output 32 [2024-11-28 05:08:39,494 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:08:39,495 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 31 treesize of output 32 [2024-11-28 05:08:39,581 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:08:39,581 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 42 treesize of output 41 [2024-11-28 05:08:39,656 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 31 treesize of output 13 [2024-11-28 05:08:39,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:39,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:08:39,687 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-28 05:08:39,688 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 21 treesize of output 20 [2024-11-28 05:08:39,695 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2914 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2914) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_#t~mem56#1.base|)) is different from false [2024-11-28 05:08:39,708 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2914 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2914) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-28 05:08:39,723 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_2913)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2914) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-28 05:08:40,087 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2911))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2912)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2913)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2914) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 05:08:40,107 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int)) (v_ArrVal_2910 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2910))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2911)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2912)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2913)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2914) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-28 05:08:40,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243392528] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:08:40,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:08:40,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 21 [2024-11-28 05:08:40,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023419659] [2024-11-28 05:08:40,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:08:40,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 05:08:40,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:40,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 05:08:40,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=610, Unknown=43, NotChecked=280, Total=1056 [2024-11-28 05:08:40,676 INFO L87 Difference]: Start difference. First operand 1518 states and 1767 transitions. Second operand has 22 states, 20 states have (on average 7.45) internal successors, (149), 22 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:08:49,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:49,343 INFO L93 Difference]: Finished difference Result 1520 states and 1774 transitions. [2024-11-28 05:08:49,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 05:08:49,344 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 7.45) internal successors, (149), 22 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2024-11-28 05:08:49,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:49,346 INFO L225 Difference]: With dead ends: 1520 [2024-11-28 05:08:49,346 INFO L226 Difference]: Without dead ends: 1520 [2024-11-28 05:08:49,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=229, Invalid=1154, Unknown=43, NotChecked=380, Total=1806 [2024-11-28 05:08:49,347 INFO L435 NwaCegarLoop]: 1048 mSDtfsCounter, 1551 mSDsluCounter, 9244 mSDsCounter, 0 mSdLazyCounter, 5965 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1566 SdHoareTripleChecker+Valid, 10292 SdHoareTripleChecker+Invalid, 6012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 5965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:49,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1566 Valid, 10292 Invalid, 6012 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [47 Valid, 5965 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2024-11-28 05:08:49,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2024-11-28 05:08:49,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1517. [2024-11-28 05:08:49,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1048 states have (on average 1.661259541984733) internal successors, (1741), 1505 states have internal predecessors, (1741), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 05:08:49,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1766 transitions. [2024-11-28 05:08:49,366 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 1766 transitions. Word has length 103 [2024-11-28 05:08:49,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:49,367 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 1766 transitions. [2024-11-28 05:08:49,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 7.45) internal successors, (149), 22 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:08:49,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1766 transitions. [2024-11-28 05:08:49,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-28 05:08:49,368 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:49,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 05:08:49,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-28 05:08:49,569 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:08:49,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:49,570 INFO L85 PathProgramCache]: Analyzing trace with hash -11229308, now seen corresponding path program 1 times [2024-11-28 05:08:49,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:08:49,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780759565] [2024-11-28 05:08:49,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:49,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:08:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:51,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:08:51,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780759565] [2024-11-28 05:08:51,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780759565] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:08:51,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132106328] [2024-11-28 05:08:51,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:51,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:08:51,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:08:51,751 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:08:51,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 05:08:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:52,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-28 05:08:52,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:08:52,205 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:52,422 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:52,453 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:08:52,453 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:52,519 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 19 treesize of output 1 [2024-11-28 05:08:52,537 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 1 [2024-11-28 05:08:52,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 22 treesize of output 10 [2024-11-28 05:08:52,729 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 9 treesize of output 3 [2024-11-28 05:08:53,104 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:08:53,104 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 73 treesize of output 66 [2024-11-28 05:08:53,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 05:08:53,435 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:08:53,436 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 73 treesize of output 66 [2024-11-28 05:08:53,444 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 30 treesize of output 13 [2024-11-28 05:08:53,688 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:08:53,689 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 73 treesize of output 66 [2024-11-28 05:08:53,697 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 30 treesize of output 13 [2024-11-28 05:08:53,941 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:08:53,941 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 73 treesize of output 66 [2024-11-28 05:08:53,949 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 30 treesize of output 13 [2024-11-28 05:08:54,177 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:08:54,177 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 73 treesize of output 66 [2024-11-28 05:08:54,192 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 30 treesize of output 13 [2024-11-28 05:08:54,408 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-28 05:08:54,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-28 05:08:54,441 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-28 05:08:54,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 25 treesize of output 27 [2024-11-28 05:08:54,589 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:08:54,589 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 88 treesize of output 79 [2024-11-28 05:08:54,613 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 52 treesize of output 16 [2024-11-28 05:08:54,797 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 44 treesize of output 20 [2024-11-28 05:08:54,804 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 0 case distinctions, treesize of input 35 treesize of output 13 [2024-11-28 05:08:54,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:08:54,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:08:56,787 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem56#1.offset_13| Int) (v_ArrVal_3118 Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3115 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_11| Int) (v_ArrVal_3117 (Array Int Int)) (v_ArrVal_3119 (Array Int Int)) (v_ArrVal_3121 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_3115))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_3114) .cse5 v_ArrVal_3116))) (or (< v_ArrVal_3121 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_11|) 0)) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3117))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (< (+ (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem56#1.offset_13| v_ArrVal_3121)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_11| v_ArrVal_3118) (select (select (store .cse3 .cse1 v_ArrVal_3119) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |v_ULTIMATE.start_main_#t~mem56#1.offset_13|) (< |v_ULTIMATE.start_main_#t~mem56#1.offset_13| 0)))))))) is different from false [2024-11-28 05:08:58,061 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3112 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem56#1.offset_13| Int) (v_ArrVal_3118 Int) (v_ArrVal_3113 (Array Int Int)) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3115 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_11| Int) (v_ArrVal_3117 (Array Int Int)) (v_ArrVal_3119 (Array Int Int)) (v_ArrVal_3121 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_3113))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse4 (store .cse8 .cse7 v_ArrVal_3115))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_3112) .cse7 v_ArrVal_3114) .cse5 v_ArrVal_3116))) (or (< v_ArrVal_3121 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_11|) 0)) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3117))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (< (+ (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem56#1.offset_13| v_ArrVal_3121)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_11| v_ArrVal_3118) (select (select (store .cse3 .cse1 v_ArrVal_3119) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |v_ULTIMATE.start_main_#t~mem56#1.offset_13|) (< |v_ULTIMATE.start_main_#t~mem56#1.offset_13| 0)))))))))) is different from false [2024-11-28 05:08:58,185 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3118 Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_11| Int) (v_ArrVal_3121 Int) (v_ArrVal_3110 (Array Int Int)) (v_ArrVal_3111 (Array Int Int)) (v_ArrVal_3112 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem56#1.offset_13| Int) (v_ArrVal_3113 (Array Int Int)) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3115 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (v_ArrVal_3117 (Array Int Int)) (v_ArrVal_3119 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3110)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3113))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse8 .cse7 v_ArrVal_3115))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3111) .cse6 v_ArrVal_3112) .cse7 v_ArrVal_3114) .cse5 v_ArrVal_3116))) (or (< v_ArrVal_3121 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_11|) 0)) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem56#1.offset_13|) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3117))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< (+ 43 (select (select (store .cse0 .cse2 (store (select .cse0 .cse2) |v_ULTIMATE.start_main_#t~mem56#1.offset_13| v_ArrVal_3121)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_11| v_ArrVal_3118) (select (select (store .cse3 .cse2 v_ArrVal_3119) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (< |v_ULTIMATE.start_main_#t~mem56#1.offset_13| 0)))))))))) is different from false [2024-11-28 05:08:58,977 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 05:08:58,978 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 12 [2024-11-28 05:08:59,051 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3118 Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_11| Int) (v_ArrVal_3121 Int) (v_ArrVal_3110 (Array Int Int)) (v_ArrVal_3111 (Array Int Int)) (v_ArrVal_3112 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem56#1.offset_13| Int) (v_ArrVal_3113 (Array Int Int)) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3126 (Array Int Int)) (v_ArrVal_3115 (Array Int Int)) (v_ArrVal_3127 (Array Int Int)) (v_ArrVal_3116 (Array Int Int)) (v_ArrVal_3117 (Array Int Int)) (v_ArrVal_3119 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3126)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_3110))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_3113))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse9 .cse8 v_ArrVal_3115))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3127) .cse6 v_ArrVal_3111) .cse7 v_ArrVal_3112) .cse8 v_ArrVal_3114) .cse5 v_ArrVal_3116))) (or (< v_ArrVal_3121 0) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem56#1.offset_13|) (= |c_ULTIMATE.start_main_#t~mem50#1.base| |v_ULTIMATE.start_main_#t~malloc57#1.base_11|) (< |v_ULTIMATE.start_main_#t~mem56#1.offset_13| 0) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3117))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< (+ (select (select (store .cse0 .cse2 (store (select .cse0 .cse2) |v_ULTIMATE.start_main_#t~mem56#1.offset_13| v_ArrVal_3121)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_11| v_ArrVal_3118) (select (select (store .cse3 .cse2 v_ArrVal_3119) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))) is different from false [2024-11-28 05:08:59,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132106328] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:08:59,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:08:59,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 33 [2024-11-28 05:08:59,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394236042] [2024-11-28 05:08:59,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:08:59,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-28 05:08:59,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:08:59,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-28 05:08:59,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1661, Unknown=27, NotChecked=348, Total=2256 [2024-11-28 05:08:59,057 INFO L87 Difference]: Start difference. First operand 1517 states and 1766 transitions. Second operand has 34 states, 31 states have (on average 5.387096774193548) internal successors, (167), 32 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:09:23,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:09:23,659 INFO L93 Difference]: Finished difference Result 1519 states and 1773 transitions. [2024-11-28 05:09:23,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 05:09:23,660 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 5.387096774193548) internal successors, (167), 32 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2024-11-28 05:09:23,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:09:23,662 INFO L225 Difference]: With dead ends: 1519 [2024-11-28 05:09:23,662 INFO L226 Difference]: Without dead ends: 1519 [2024-11-28 05:09:23,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=412, Invalid=2769, Unknown=27, NotChecked=452, Total=3660 [2024-11-28 05:09:23,663 INFO L435 NwaCegarLoop]: 1041 mSDtfsCounter, 1531 mSDsluCounter, 15447 mSDsCounter, 0 mSdLazyCounter, 14255 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 16488 SdHoareTripleChecker+Invalid, 14286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 14255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:09:23,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 16488 Invalid, 14286 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [31 Valid, 14255 Invalid, 0 Unknown, 0 Unchecked, 23.1s Time] [2024-11-28 05:09:23,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2024-11-28 05:09:23,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1494. [2024-11-28 05:09:23,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 1027 states have (on average 1.6728334956183057) internal successors, (1718), 1483 states have internal predecessors, (1718), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 05:09:23,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1742 transitions. [2024-11-28 05:09:23,676 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1742 transitions. Word has length 103 [2024-11-28 05:09:23,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:09:23,676 INFO L471 AbstractCegarLoop]: Abstraction has 1494 states and 1742 transitions. [2024-11-28 05:09:23,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 5.387096774193548) internal successors, (167), 32 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:09:23,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1742 transitions. [2024-11-28 05:09:23,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-28 05:09:23,677 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:09:23,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-28 05:09:23,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-28 05:09:23,878 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:09:23,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:09:23,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1425267602, now seen corresponding path program 1 times [2024-11-28 05:09:23,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:09:23,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906737637] [2024-11-28 05:09:23,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:09:23,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:09:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:09:25,214 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:09:25,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:09:25,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906737637] [2024-11-28 05:09:25,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906737637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:09:25,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:09:25,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-28 05:09:25,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107848370] [2024-11-28 05:09:25,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:09:25,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 05:09:25,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:09:25,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 05:09:25,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-28 05:09:25,216 INFO L87 Difference]: Start difference. First operand 1494 states and 1742 transitions. Second operand has 17 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:09:36,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:09:36,686 INFO L93 Difference]: Finished difference Result 1545 states and 1801 transitions. [2024-11-28 05:09:36,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 05:09:36,686 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2024-11-28 05:09:36,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:09:36,689 INFO L225 Difference]: With dead ends: 1545 [2024-11-28 05:09:36,689 INFO L226 Difference]: Without dead ends: 1545 [2024-11-28 05:09:36,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2024-11-28 05:09:36,690 INFO L435 NwaCegarLoop]: 1046 mSDtfsCounter, 1593 mSDsluCounter, 12260 mSDsCounter, 0 mSdLazyCounter, 7762 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 13306 SdHoareTripleChecker+Invalid, 7791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 7762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:09:36,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 13306 Invalid, 7791 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 7762 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2024-11-28 05:09:36,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-11-28 05:09:36,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1519. [2024-11-28 05:09:36,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1051 states have (on average 1.659372026641294) internal successors, (1744), 1507 states have internal predecessors, (1744), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 05:09:36,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 1769 transitions. [2024-11-28 05:09:36,718 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 1769 transitions. Word has length 105 [2024-11-28 05:09:36,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:09:36,718 INFO L471 AbstractCegarLoop]: Abstraction has 1519 states and 1769 transitions. [2024-11-28 05:09:36,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:09:36,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1769 transitions. [2024-11-28 05:09:36,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-28 05:09:36,719 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:09:36,720 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-28 05:09:36,720 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:09:36,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:09:36,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1425267603, now seen corresponding path program 1 times [2024-11-28 05:09:36,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:09:36,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859199768] [2024-11-28 05:09:36,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:09:36,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:09:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:09:38,244 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:09:38,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:09:38,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859199768] [2024-11-28 05:09:38,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859199768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:09:38,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:09:38,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 05:09:38,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541094363] [2024-11-28 05:09:38,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:09:38,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 05:09:38,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:09:38,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 05:09:38,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-28 05:09:38,246 INFO L87 Difference]: Start difference. First operand 1519 states and 1769 transitions. Second operand has 16 states, 15 states have (on average 6.866666666666666) internal successors, (103), 16 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:09:49,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:09:49,395 INFO L93 Difference]: Finished difference Result 1544 states and 1800 transitions. [2024-11-28 05:09:49,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 05:09:49,396 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.866666666666666) internal successors, (103), 16 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2024-11-28 05:09:49,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:09:49,397 INFO L225 Difference]: With dead ends: 1544 [2024-11-28 05:09:49,397 INFO L226 Difference]: Without dead ends: 1544 [2024-11-28 05:09:49,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2024-11-28 05:09:49,398 INFO L435 NwaCegarLoop]: 1042 mSDtfsCounter, 1612 mSDsluCounter, 9783 mSDsCounter, 0 mSdLazyCounter, 7053 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1627 SdHoareTripleChecker+Valid, 10825 SdHoareTripleChecker+Invalid, 7083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 7053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:09:49,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1627 Valid, 10825 Invalid, 7083 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 7053 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2024-11-28 05:09:49,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2024-11-28 05:09:49,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1519. [2024-11-28 05:09:49,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1051 states have (on average 1.6584205518553758) internal successors, (1743), 1507 states have internal predecessors, (1743), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 05:09:49,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 1768 transitions. [2024-11-28 05:09:49,424 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 1768 transitions. Word has length 105 [2024-11-28 05:09:49,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:09:49,424 INFO L471 AbstractCegarLoop]: Abstraction has 1519 states and 1768 transitions. [2024-11-28 05:09:49,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.866666666666666) internal successors, (103), 16 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:09:49,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1768 transitions. [2024-11-28 05:09:49,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-28 05:09:49,425 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:09:49,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-28 05:09:49,426 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:09:49,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:09:49,426 INFO L85 PathProgramCache]: Analyzing trace with hash 475770014, now seen corresponding path program 1 times [2024-11-28 05:09:49,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:09:49,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911449921] [2024-11-28 05:09:49,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:09:49,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:09:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:09:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 05:09:53,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:09:53,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911449921] [2024-11-28 05:09:53,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911449921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:09:53,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:09:53,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 05:09:53,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102538440] [2024-11-28 05:09:53,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:09:53,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 05:09:53,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:09:53,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 05:09:53,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-28 05:09:53,023 INFO L87 Difference]: Start difference. First operand 1519 states and 1768 transitions. Second operand has 15 states, 14 states have (on average 7.428571428571429) internal successors, (104), 15 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:10:04,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:10:04,238 INFO L93 Difference]: Finished difference Result 1518 states and 1767 transitions. [2024-11-28 05:10:04,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 05:10:04,239 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.428571428571429) internal successors, (104), 15 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-28 05:10:04,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:10:04,241 INFO L225 Difference]: With dead ends: 1518 [2024-11-28 05:10:04,241 INFO L226 Difference]: Without dead ends: 1518 [2024-11-28 05:10:04,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2024-11-28 05:10:04,242 INFO L435 NwaCegarLoop]: 1054 mSDtfsCounter, 4625 mSDsluCounter, 10227 mSDsCounter, 0 mSdLazyCounter, 6447 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4634 SdHoareTripleChecker+Valid, 11281 SdHoareTripleChecker+Invalid, 6492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 6447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:10:04,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4634 Valid, 11281 Invalid, 6492 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [45 Valid, 6447 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2024-11-28 05:10:04,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-11-28 05:10:04,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1518. [2024-11-28 05:10:04,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1051 states have (on average 1.6574690770694576) internal successors, (1742), 1506 states have internal predecessors, (1742), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 05:10:04,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1767 transitions. [2024-11-28 05:10:04,256 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1767 transitions. Word has length 106 [2024-11-28 05:10:04,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:10:04,257 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 1767 transitions. [2024-11-28 05:10:04,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.428571428571429) internal successors, (104), 15 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:10:04,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1767 transitions. [2024-11-28 05:10:04,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-28 05:10:04,257 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:10:04,257 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:04,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-28 05:10:04,258 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:10:04,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:10:04,258 INFO L85 PathProgramCache]: Analyzing trace with hash 475770015, now seen corresponding path program 1 times [2024-11-28 05:10:04,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:10:04,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528332758] [2024-11-28 05:10:04,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:10:04,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:10:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:10:06,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:10:06,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:10:06,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528332758] [2024-11-28 05:10:06,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528332758] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:10:06,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889000216] [2024-11-28 05:10:06,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:10:06,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:10:06,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:10:06,259 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:10:06,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 05:10:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:10:06,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-28 05:10:06,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:10:06,770 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:10:06,995 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:10:06,996 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:10:07,009 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 1 [2024-11-28 05:10:07,017 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 13 treesize of output 9 [2024-11-28 05:10:07,184 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:10:07,184 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 51 treesize of output 48 [2024-11-28 05:10:07,190 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 30 treesize of output 13 [2024-11-28 05:10:07,300 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:10:07,301 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 51 treesize of output 48 [2024-11-28 05:10:07,306 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 30 treesize of output 13 [2024-11-28 05:10:07,426 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:10:07,426 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 51 treesize of output 48 [2024-11-28 05:10:07,434 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 30 treesize of output 13 [2024-11-28 05:10:07,582 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:10:07,583 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 51 treesize of output 48 [2024-11-28 05:10:07,588 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 30 treesize of output 13 [2024-11-28 05:10:07,723 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:10:07,723 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 51 treesize of output 48 [2024-11-28 05:10:07,730 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 30 treesize of output 13 [2024-11-28 05:10:07,872 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:10:07,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:10:07,878 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 30 treesize of output 13 [2024-11-28 05:10:08,086 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:10:08,086 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 62 treesize of output 57 [2024-11-28 05:10:08,099 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 30 treesize of output 13 [2024-11-28 05:10:08,124 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 31 treesize of output 13 [2024-11-28 05:10:08,130 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 9 treesize of output 3 [2024-11-28 05:10:08,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:10:08,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:10:08,290 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3624 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3624) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_ArrVal_3623 (Array Int Int)) (v_ArrVal_3624 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3624) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3623) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 05:10:08,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:10:08,454 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 84 [2024-11-28 05:10:08,809 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3622 (Array Int Int)) (v_ArrVal_3624 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3622) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3621) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3624) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)) (forall ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_40) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_41) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3623 (Array Int Int))) (= .cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3621))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3623)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:10:08,859 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3619 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3622 (Array Int Int)) (v_ArrVal_3624 (Array Int Int))) (< (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3620))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3619) .cse0 v_ArrVal_3622) (select (select (store .cse1 .cse0 v_ArrVal_3621) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3624))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)) (forall ((v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3623 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3620))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3621))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3623)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse5)))) (forall ((v_ArrVal_3619 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3620))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3619) .cse6 v_prenex_40) (select (select (store .cse7 .cse6 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_41))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-28 05:10:08,894 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3623 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3620))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3621))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3623)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) (forall ((v_ArrVal_3619 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int))) (<= 0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3620))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_3619) .cse5 v_prenex_40) (select (select (store .cse6 .cse5 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_41))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3619 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3622 (Array Int Int)) (v_ArrVal_3624 (Array Int Int))) (< (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3620))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_3619) .cse7 v_ArrVal_3622) (select (select (store .cse8 .cse7 v_ArrVal_3621) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3624))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1))))) is different from false [2024-11-28 05:10:08,956 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3619 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (<= 0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3618))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_3620))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3617) .cse0 v_ArrVal_3619) .cse1 v_prenex_40) (select (select (store .cse2 .cse1 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_41))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3619 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3622 (Array Int Int)) (v_ArrVal_3624 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (< (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3618))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_3620))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3617) .cse5 v_ArrVal_3619) .cse6 v_ArrVal_3622) (select (select (store .cse7 .cse6 v_ArrVal_3621) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3624))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3623 (Array Int Int))) (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3618))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3620)))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= .cse9 (select (select (let ((.cse10 (store .cse11 .cse9 v_ArrVal_3621))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3623)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2024-11-28 05:10:08,996 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3623 (Array Int Int))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3618))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3620)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3621))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3623)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3619 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3622 (Array Int Int)) (v_ArrVal_3624 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (< (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3618))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3620))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_3617) .cse6 v_ArrVal_3619) .cse7 v_ArrVal_3622) (select (select (store .cse8 .cse7 v_ArrVal_3621) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3624))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3619 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (<= 0 (select (select (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3618))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3620))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_3617) .cse10 v_ArrVal_3619) .cse11 v_prenex_40) (select (select (store .cse12 .cse11 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_41))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:10:10,118 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3619 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3622 (Array Int Int)) (v_ArrVal_3624 (Array Int Int)) (v_ArrVal_3615 (Array Int Int)) (v_ArrVal_3616 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (< (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3616))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_3618))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_3620))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3615) .cse0 v_ArrVal_3617) .cse1 v_ArrVal_3619) .cse2 v_ArrVal_3622) (select (select (store .cse3 .cse2 v_ArrVal_3621) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3624))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1)) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3619 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3615 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3616 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (<= 0 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3616))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_3618))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_3620))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3615) .cse7 v_ArrVal_3617) .cse8 v_ArrVal_3619) .cse9 v_prenex_40) (select (select (store .cse10 .cse9 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_41))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3623 (Array Int Int)) (v_ArrVal_3616 (Array Int Int))) (let ((.cse14 (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3616))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3618)))) (store .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3620)))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (= (select (select (let ((.cse13 (store .cse14 .cse15 v_ArrVal_3621))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_3623)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) .cse15)))))) is different from false [2024-11-28 05:10:14,350 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3619 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3622 (Array Int Int)) (v_ArrVal_3624 (Array Int Int)) (v_ArrVal_3615 (Array Int Int)) (v_ArrVal_3616 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (< (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3616))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3618))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3620))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3615) .cse1 v_ArrVal_3617) .cse2 v_ArrVal_3619) .cse3 v_ArrVal_3622) (select (select (store .cse4 .cse3 v_ArrVal_3621) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3624))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 1)) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3619 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3615 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3616 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (<= 0 (select (select (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3616))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_3618))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_3620))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3615) .cse8 v_ArrVal_3617) .cse9 v_ArrVal_3619) .cse10 v_prenex_40) (select (select (store .cse11 .cse10 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_41))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3623 (Array Int Int)) (v_ArrVal_3616 (Array Int Int))) (let ((.cse16 (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3616))) (store .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3618)))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3620)))) (let ((.cse14 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (= .cse14 (select (select (let ((.cse15 (store .cse16 .cse14 v_ArrVal_3621))) (store .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3623)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))) is different from false [2024-11-28 05:10:18,881 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3623 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3616 (Array Int Int))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3613))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3616)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3618)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3620)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3621))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3623)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3619 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3622 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3624 (Array Int Int)) (v_ArrVal_3614 (Array Int Int)) (v_ArrVal_3615 (Array Int Int)) (v_ArrVal_3616 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (< (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3613))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_3616))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_3618))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_3620))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3614) .cse7 v_ArrVal_3615) .cse8 v_ArrVal_3617) .cse9 v_ArrVal_3619) .cse10 v_ArrVal_3622) (select (select (store .cse11 .cse10 v_ArrVal_3621) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3624))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3619 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3614 (Array Int Int)) (v_ArrVal_3615 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3616 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (<= 0 (select (select (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3613))) (let ((.cse15 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse21 (store .cse22 .cse15 v_ArrVal_3616))) (let ((.cse16 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse20 (store .cse21 .cse16 v_ArrVal_3618))) (let ((.cse17 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse19 (store .cse20 .cse17 v_ArrVal_3620))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_3614) .cse15 v_ArrVal_3615) .cse16 v_ArrVal_3617) .cse17 v_ArrVal_3619) .cse18 v_prenex_40) (select (select (store .cse19 .cse18 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_41))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-28 05:10:23,201 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (and (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3619 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3622 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3624 (Array Int Int)) (v_ArrVal_3614 (Array Int Int)) (v_ArrVal_3615 (Array Int Int)) (v_ArrVal_3616 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (< (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3613))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_3616))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_3618))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_3620))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3614) .cse1 v_ArrVal_3615) .cse2 v_ArrVal_3617) .cse3 v_ArrVal_3619) .cse4 v_ArrVal_3622) (select (select (store .cse5 .cse4 v_ArrVal_3621) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3624))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) 1)) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3619 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3614 (Array Int Int)) (v_ArrVal_3615 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3616 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (<= 0 (select (select (let ((.cse17 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3613))) (let ((.cse10 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse16 (store .cse17 .cse10 v_ArrVal_3616))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_3618))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_3620))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3614) .cse10 v_ArrVal_3615) .cse11 v_ArrVal_3617) .cse12 v_ArrVal_3619) .cse13 v_prenex_40) (select (select (store .cse14 .cse13 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_prenex_41))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3623 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3616 (Array Int Int))) (let ((.cse19 (let ((.cse21 (let ((.cse22 (let ((.cse23 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3613))) (store .cse23 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3616)))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3618)))) (store .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3620)))) (let ((.cse20 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (= (select (select (let ((.cse18 (store .cse19 .cse20 v_ArrVal_3621))) (store .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3623)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) .cse20))))))) is different from false [2024-11-28 05:10:27,924 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3629 (Array Int Int)) (v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3619 (Array Int Int)) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3622 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3624 (Array Int Int)) (v_ArrVal_3614 (Array Int Int)) (v_ArrVal_3615 (Array Int Int)) (v_ArrVal_3616 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (< (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3629))) (let ((.cse0 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse9 (store .cse10 .cse0 v_ArrVal_3613))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_3616))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_3618))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_3620))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3630) .cse0 v_ArrVal_3614) .cse1 v_ArrVal_3615) .cse2 v_ArrVal_3617) .cse3 v_ArrVal_3619) .cse4 v_ArrVal_3622) (select (select (store .cse5 .cse4 v_ArrVal_3621) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3624))))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) 1)) (forall ((v_ArrVal_3629 (Array Int Int)) (v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3619 (Array Int Int)) (v_ArrVal_3630 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3614 (Array Int Int)) (v_ArrVal_3615 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_3616 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (<= 0 (select (select (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3629))) (let ((.cse11 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse19 (store .cse20 .cse11 v_ArrVal_3613))) (let ((.cse12 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse18 (store .cse19 .cse12 v_ArrVal_3616))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_3618))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_3620))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3630) .cse11 v_ArrVal_3614) .cse12 v_ArrVal_3615) .cse13 v_ArrVal_3617) .cse14 v_ArrVal_3619) .cse15 v_prenex_40) (select (select (store .cse16 .cse15 v_prenex_39) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_prenex_41))))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (forall ((v_ArrVal_3629 (Array Int Int)) (v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3620 (Array Int Int)) (v_ArrVal_3621 (Array Int Int)) (v_ArrVal_3623 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3616 (Array Int Int))) (let ((.cse22 (let ((.cse24 (let ((.cse25 (let ((.cse26 (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_3629))) (store .cse27 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3613)))) (store .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3616)))) (store .cse25 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3618)))) (store .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3620)))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (= (select (select (let ((.cse21 (store .cse22 .cse23 v_ArrVal_3621))) (store .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3623)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) .cse23)))))) is different from false [2024-11-28 05:10:28,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889000216] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:10:28,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:10:28,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 25 [2024-11-28 05:10:28,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627017517] [2024-11-28 05:10:28,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:10:28,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 05:10:28,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:10:28,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 05:10:28,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=756, Unknown=44, NotChecked=726, Total=1640 [2024-11-28 05:10:28,010 INFO L87 Difference]: Start difference. First operand 1518 states and 1767 transitions. Second operand has 26 states, 23 states have (on average 6.869565217391305) internal successors, (158), 26 states have internal predecessors, (158), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:11:42,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:11:42,971 INFO L93 Difference]: Finished difference Result 1534 states and 1788 transitions. [2024-11-28 05:11:42,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 05:11:42,972 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 6.869565217391305) internal successors, (158), 26 states have internal predecessors, (158), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 106 [2024-11-28 05:11:42,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:11:42,973 INFO L225 Difference]: With dead ends: 1534 [2024-11-28 05:11:42,973 INFO L226 Difference]: Without dead ends: 1534 [2024-11-28 05:11:42,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=218, Invalid=1417, Unknown=49, NotChecked=968, Total=2652 [2024-11-28 05:11:42,975 INFO L435 NwaCegarLoop]: 1041 mSDtfsCounter, 1592 mSDsluCounter, 9822 mSDsCounter, 0 mSdLazyCounter, 7168 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 70.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1605 SdHoareTripleChecker+Valid, 10863 SdHoareTripleChecker+Invalid, 7216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 7168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 71.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:11:42,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1605 Valid, 10863 Invalid, 7216 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 7168 Invalid, 0 Unknown, 0 Unchecked, 71.6s Time] [2024-11-28 05:11:42,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2024-11-28 05:11:42,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1492. [2024-11-28 05:11:42,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1027 states have (on average 1.6708860759493671) internal successors, (1716), 1481 states have internal predecessors, (1716), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 05:11:42,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1740 transitions. [2024-11-28 05:11:42,991 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1740 transitions. Word has length 106 [2024-11-28 05:11:42,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:11:42,992 INFO L471 AbstractCegarLoop]: Abstraction has 1492 states and 1740 transitions. [2024-11-28 05:11:42,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 6.869565217391305) internal successors, (158), 26 states have internal predecessors, (158), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:11:42,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1740 transitions. [2024-11-28 05:11:42,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-28 05:11:42,993 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:11:42,993 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 05:11:43,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2024-11-28 05:11:43,193 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:11:43,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:43,194 INFO L85 PathProgramCache]: Analyzing trace with hash 101128131, now seen corresponding path program 1 times [2024-11-28 05:11:43,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:43,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444249565] [2024-11-28 05:11:43,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:43,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:43,501 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:11:43,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:11:43,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444249565] [2024-11-28 05:11:43,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444249565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:11:43,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:11:43,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:11:43,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452483931] [2024-11-28 05:11:43,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:11:43,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:11:43,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:11:43,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:11:43,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:11:43,502 INFO L87 Difference]: Start difference. First operand 1492 states and 1740 transitions. Second operand has 5 states, 4 states have (on average 26.5) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:11:57,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:11:57,029 INFO L93 Difference]: Finished difference Result 1491 states and 1739 transitions. [2024-11-28 05:11:57,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:11:57,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 26.5) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2024-11-28 05:11:57,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:11:57,032 INFO L225 Difference]: With dead ends: 1491 [2024-11-28 05:11:57,032 INFO L226 Difference]: Without dead ends: 1491 [2024-11-28 05:11:57,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:11:57,033 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 5 mSDsluCounter, 3480 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5087 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:11:57,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5087 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 13.4s Time] [2024-11-28 05:11:57,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2024-11-28 05:11:57,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1491. [2024-11-28 05:11:57,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1491 states, 1027 states have (on average 1.6699123661148978) internal successors, (1715), 1480 states have internal predecessors, (1715), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 05:11:57,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 1739 transitions. [2024-11-28 05:11:57,053 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 1739 transitions. Word has length 108 [2024-11-28 05:11:57,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:11:57,053 INFO L471 AbstractCegarLoop]: Abstraction has 1491 states and 1739 transitions. [2024-11-28 05:11:57,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 26.5) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:11:57,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1739 transitions. [2024-11-28 05:11:57,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-28 05:11:57,054 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:11:57,054 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-28 05:11:57,055 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:11:57,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:57,055 INFO L85 PathProgramCache]: Analyzing trace with hash 101128132, now seen corresponding path program 1 times [2024-11-28 05:11:57,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:11:57,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120342416] [2024-11-28 05:11:57,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:57,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:11:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:12:01,777 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:12:01,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:12:01,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120342416] [2024-11-28 05:12:01,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120342416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:12:01,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:12:01,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 05:12:01,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533675992] [2024-11-28 05:12:01,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:12:01,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 05:12:01,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:12:01,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 05:12:01,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-28 05:12:01,780 INFO L87 Difference]: Start difference. First operand 1491 states and 1739 transitions. Second operand has 18 states, 17 states have (on average 6.235294117647059) internal successors, (106), 18 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:13:18,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:13:18,103 INFO L93 Difference]: Finished difference Result 1539 states and 1795 transitions. [2024-11-28 05:13:18,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 05:13:18,104 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.235294117647059) internal successors, (106), 18 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2024-11-28 05:13:18,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:13:18,106 INFO L225 Difference]: With dead ends: 1539 [2024-11-28 05:13:18,106 INFO L226 Difference]: Without dead ends: 1539 [2024-11-28 05:13:18,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2024-11-28 05:13:18,107 INFO L435 NwaCegarLoop]: 1042 mSDtfsCounter, 1620 mSDsluCounter, 9391 mSDsCounter, 0 mSdLazyCounter, 7483 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1635 SdHoareTripleChecker+Valid, 10433 SdHoareTripleChecker+Invalid, 7513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 7483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 73.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:13:18,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1635 Valid, 10433 Invalid, 7513 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 7483 Invalid, 0 Unknown, 0 Unchecked, 73.8s Time] [2024-11-28 05:13:18,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2024-11-28 05:13:18,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1519. [2024-11-28 05:13:18,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1054 states have (on average 1.6537001897533208) internal successors, (1743), 1507 states have internal predecessors, (1743), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-28 05:13:18,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 1768 transitions. [2024-11-28 05:13:18,124 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 1768 transitions. Word has length 108 [2024-11-28 05:13:18,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:13:18,124 INFO L471 AbstractCegarLoop]: Abstraction has 1519 states and 1768 transitions. [2024-11-28 05:13:18,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.235294117647059) internal successors, (106), 18 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:13:18,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1768 transitions. [2024-11-28 05:13:18,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-28 05:13:18,125 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:13:18,125 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:18,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-28 05:13:18,126 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:13:18,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:13:18,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1159994538, now seen corresponding path program 1 times [2024-11-28 05:13:18,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:13:18,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466174330] [2024-11-28 05:13:18,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:18,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:13:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:13:23,682 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:13:23,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:13:23,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466174330] [2024-11-28 05:13:23,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466174330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:13:23,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:13:23,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 05:13:23,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817950228] [2024-11-28 05:13:23,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:13:23,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 05:13:23,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:13:23,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 05:13:23,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-28 05:13:23,684 INFO L87 Difference]: Start difference. First operand 1519 states and 1768 transitions. Second operand has 19 states, 18 states have (on average 5.944444444444445) internal successors, (107), 19 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:14:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:14:32,320 INFO L93 Difference]: Finished difference Result 1539 states and 1795 transitions. [2024-11-28 05:14:32,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 05:14:32,321 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.944444444444445) internal successors, (107), 19 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-28 05:14:32,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:14:32,323 INFO L225 Difference]: With dead ends: 1539 [2024-11-28 05:14:32,323 INFO L226 Difference]: Without dead ends: 1539 [2024-11-28 05:14:32,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2024-11-28 05:14:32,324 INFO L435 NwaCegarLoop]: 1045 mSDtfsCounter, 1638 mSDsluCounter, 10218 mSDsCounter, 0 mSdLazyCounter, 6630 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1653 SdHoareTripleChecker+Valid, 11263 SdHoareTripleChecker+Invalid, 6664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 6630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 65.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:14:32,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1653 Valid, 11263 Invalid, 6664 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 6630 Invalid, 0 Unknown, 0 Unchecked, 65.6s Time] [2024-11-28 05:14:32,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2024-11-28 05:14:32,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1520. [2024-11-28 05:14:32,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1055 states have (on average 1.6530805687203791) internal successors, (1744), 1508 states have internal predecessors, (1744), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (13), 8 states have call predecessors, (13), 12 states have call successors, (13) [2024-11-28 05:14:32,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 1771 transitions. [2024-11-28 05:14:32,345 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 1771 transitions. Word has length 109 [2024-11-28 05:14:32,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:14:32,345 INFO L471 AbstractCegarLoop]: Abstraction has 1520 states and 1771 transitions. [2024-11-28 05:14:32,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.944444444444445) internal successors, (107), 19 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:14:32,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1771 transitions. [2024-11-28 05:14:32,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-28 05:14:32,346 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:14:32,346 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:32,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-28 05:14:32,346 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:14:32,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:14:32,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1159994537, now seen corresponding path program 1 times [2024-11-28 05:14:32,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:14:32,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575533294] [2024-11-28 05:14:32,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:14:32,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:14:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:14:38,606 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:14:38,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:14:38,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575533294] [2024-11-28 05:14:38,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575533294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:14:38,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:14:38,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-28 05:14:38,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152106857] [2024-11-28 05:14:38,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:14:38,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 05:14:38,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:14:38,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 05:14:38,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2024-11-28 05:14:38,608 INFO L87 Difference]: Start difference. First operand 1520 states and 1771 transitions. Second operand has 21 states, 20 states have (on average 5.35) internal successors, (107), 21 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:16:02,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:16:02,745 INFO L93 Difference]: Finished difference Result 1538 states and 1794 transitions. [2024-11-28 05:16:02,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 05:16:02,746 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.35) internal successors, (107), 21 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-28 05:16:02,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:16:02,748 INFO L225 Difference]: With dead ends: 1538 [2024-11-28 05:16:02,748 INFO L226 Difference]: Without dead ends: 1538 [2024-11-28 05:16:02,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=166, Invalid=1166, Unknown=0, NotChecked=0, Total=1332 [2024-11-28 05:16:02,749 INFO L435 NwaCegarLoop]: 1045 mSDtfsCounter, 1588 mSDsluCounter, 9590 mSDsCounter, 0 mSdLazyCounter, 7226 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 79.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1603 SdHoareTripleChecker+Valid, 10635 SdHoareTripleChecker+Invalid, 7258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 7226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 80.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:16:02,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1603 Valid, 10635 Invalid, 7258 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [32 Valid, 7226 Invalid, 0 Unknown, 0 Unchecked, 80.3s Time] [2024-11-28 05:16:02,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2024-11-28 05:16:02,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1520. [2024-11-28 05:16:02,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1054 states have (on average 1.6537001897533208) internal successors, (1743), 1508 states have internal predecessors, (1743), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (13), 8 states have call predecessors, (13), 12 states have call successors, (13) [2024-11-28 05:16:02,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 1770 transitions. [2024-11-28 05:16:02,762 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 1770 transitions. Word has length 109 [2024-11-28 05:16:02,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:16:02,763 INFO L471 AbstractCegarLoop]: Abstraction has 1520 states and 1770 transitions. [2024-11-28 05:16:02,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.35) internal successors, (107), 21 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:16:02,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1770 transitions. [2024-11-28 05:16:02,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-28 05:16:02,763 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:16:02,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:02,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-28 05:16:02,764 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:16:02,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:16:02,764 INFO L85 PathProgramCache]: Analyzing trace with hash 273095480, now seen corresponding path program 1 times [2024-11-28 05:16:02,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:16:02,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801956682] [2024-11-28 05:16:02,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:02,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:16:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:16:03,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 05:16:03,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:16:03,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801956682] [2024-11-28 05:16:03,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801956682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:16:03,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:16:03,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:16:03,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919861241] [2024-11-28 05:16:03,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:16:03,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:16:03,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:16:03,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:16:03,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:16:03,579 INFO L87 Difference]: Start difference. First operand 1520 states and 1770 transitions. Second operand has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:16:19,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:16:19,656 INFO L93 Difference]: Finished difference Result 1519 states and 1769 transitions. [2024-11-28 05:16:19,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:16:19,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-28 05:16:19,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:16:19,659 INFO L225 Difference]: With dead ends: 1519 [2024-11-28 05:16:19,660 INFO L226 Difference]: Without dead ends: 1519 [2024-11-28 05:16:19,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:16:19,661 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 4 mSDsluCounter, 3494 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5101 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:16:19,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5101 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 15.9s Time] [2024-11-28 05:16:19,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2024-11-28 05:16:19,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1519. [2024-11-28 05:16:19,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1054 states have (on average 1.6527514231499052) internal successors, (1742), 1507 states have internal predecessors, (1742), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (13), 8 states have call predecessors, (13), 12 states have call successors, (13) [2024-11-28 05:16:19,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 1769 transitions. [2024-11-28 05:16:19,681 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 1769 transitions. Word has length 109 [2024-11-28 05:16:19,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:16:19,682 INFO L471 AbstractCegarLoop]: Abstraction has 1519 states and 1769 transitions. [2024-11-28 05:16:19,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:16:19,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1769 transitions. [2024-11-28 05:16:19,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-28 05:16:19,683 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:16:19,683 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:19,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-28 05:16:19,683 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:16:19,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:16:19,684 INFO L85 PathProgramCache]: Analyzing trace with hash -123974046, now seen corresponding path program 1 times [2024-11-28 05:16:19,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:16:19,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494932988] [2024-11-28 05:16:19,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:19,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:16:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:16:26,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:16:26,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:16:26,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494932988] [2024-11-28 05:16:26,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494932988] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:16:26,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525815469] [2024-11-28 05:16:26,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:26,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:16:26,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:16:26,393 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:16:26,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 05:16:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:16:26,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-28 05:16:26,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:16:26,991 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:16:28,547 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:16:28,547 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:16:28,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 19 treesize of output 1 [2024-11-28 05:16:28,983 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 19 treesize of output 1 [2024-11-28 05:16:30,315 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:16:30,315 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 51 treesize of output 48 [2024-11-28 05:16:30,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 30 treesize of output 13 [2024-11-28 05:16:31,063 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:16:31,064 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 51 treesize of output 48 [2024-11-28 05:16:31,088 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 30 treesize of output 13 [2024-11-28 05:16:31,830 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:16:31,831 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 51 treesize of output 48 [2024-11-28 05:16:31,882 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 30 treesize of output 13 [2024-11-28 05:16:32,640 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:16:32,640 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 51 treesize of output 48 [2024-11-28 05:16:32,680 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 30 treesize of output 13 [2024-11-28 05:16:33,581 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:16:33,581 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 51 treesize of output 48 [2024-11-28 05:16:33,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 05:16:34,454 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:16:35,367 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-11-28 05:16:35,367 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 79 treesize of output 45 [2024-11-28 05:16:35,398 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 39 treesize of output 20 [2024-11-28 05:16:36,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:16:37,004 INFO L349 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2024-11-28 05:16:37,004 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 2 case distinctions, treesize of input 83 treesize of output 52 [2024-11-28 05:16:37,056 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 30 treesize of output 13 [2024-11-28 05:16:37,442 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 9 treesize of output 3 [2024-11-28 05:16:38,039 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-28 05:16:38,039 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 39 treesize of output 16 [2024-11-28 05:16:38,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:16:38,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:16:38,284 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4311 (Array Int Int)) (v_ArrVal_4312 (Array Int Int))) (or (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4311))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) 1) (not (= v_ArrVal_4311 (let ((.cse2 (+ 40 |c_ULTIMATE.start_main_#t~mem58#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base|) .cse2 (select v_ArrVal_4311 .cse2))))))) is different from false [2024-11-28 05:16:38,393 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4311 (Array Int Int)) (v_ArrVal_4312 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (= (select |c_#valid| (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_4311))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_4312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1) (not (= (let ((.cse3 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select |c_#memory_$Pointer$#1.base| .cse2) .cse3 (select v_ArrVal_4311 .cse3))) v_ArrVal_4311)))))) is different from false [2024-11-28 05:16:39,368 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 272 treesize of output 184 [2024-11-28 05:16:40,453 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4311 (Array Int Int)) (v_ArrVal_4312 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem56#1.offset_19| Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4309 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse6 (store (select |c_#memory_$Pointer$#1.base| .cse6) |v_ULTIMATE.start_main_#t~mem56#1.offset_19| |v_ULTIMATE.start_main_#t~malloc57#1.base_16|)))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_4309)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (or (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) |v_ULTIMATE.start_main_#t~mem56#1.offset_19|) (< |v_ULTIMATE.start_main_#t~mem56#1.offset_19| 0) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (= (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4311))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (select (select (store .cse1 .cse4 v_ArrVal_4312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) |v_ULTIMATE.start_main_#t~malloc57#1.base_16|) (not (= v_ArrVal_4311 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4311 .cse5))))))))))) is different from false [2024-11-28 05:16:41,002 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4311 (Array Int Int)) (v_ArrVal_4312 (Array Int Int)) (v_ArrVal_4306 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem56#1.offset_19| Int) (v_ArrVal_4307 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4309 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4307)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) |v_ULTIMATE.start_main_#t~mem56#1.offset_19| |v_ULTIMATE.start_main_#t~malloc57#1.base_16|))) (.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4306))) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_4309)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= v_ArrVal_4311 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4311 .cse2))))) (< |v_ULTIMATE.start_main_#t~mem56#1.offset_19| 0) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_16| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4311))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~mem56#1.offset_19|))))))) is different from false [2024-11-28 05:16:41,355 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4311 (Array Int Int)) (v_ArrVal_4312 (Array Int Int)) (v_ArrVal_4306 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem56#1.offset_19| Int) (v_ArrVal_4307 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4309 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4307))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4306)) (.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) |v_ULTIMATE.start_main_#t~mem56#1.offset_19| |v_ULTIMATE.start_main_#t~malloc57#1.base_16|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store .cse6 .cse7 v_ArrVal_4309))) (or (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4311 .cse2))) v_ArrVal_4311)) (< |v_ULTIMATE.start_main_#t~mem56#1.offset_19| 0) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_16| (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_4311))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse5 .cse1 v_ArrVal_4312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~mem56#1.offset_19|) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) is different from false [2024-11-28 05:16:42,006 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4311 (Array Int Int)) (v_ArrVal_4312 (Array Int Int)) (v_ArrVal_4304 (Array Int Int)) (v_ArrVal_4305 (Array Int Int)) (v_ArrVal_4306 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem56#1.offset_19| Int) (v_ArrVal_4307 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4309 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4305)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse9 (store .cse10 .cse8 v_ArrVal_4307))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse9 .cse7 (store (select .cse9 .cse7) |v_ULTIMATE.start_main_#t~mem56#1.offset_19| |v_ULTIMATE.start_main_#t~malloc57#1.base_16|))) (.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4304) .cse8 v_ArrVal_4306))) (let ((.cse2 (store .cse0 .cse7 v_ArrVal_4309)) (.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem56#1.offset_19|) (< |v_ULTIMATE.start_main_#t~mem56#1.offset_19| 0) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= (select (let ((.cse3 (store .cse4 .cse5 v_ArrVal_4311))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse2 .cse5 v_ArrVal_4312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc57#1.base_16|) (not (= (let ((.cse6 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse4 .cse5) .cse6 (select v_ArrVal_4311 .cse6))) v_ArrVal_4311)))))))))) is different from false [2024-11-28 05:16:42,281 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4311 (Array Int Int)) (v_ArrVal_4312 (Array Int Int)) (v_ArrVal_4304 (Array Int Int)) (v_ArrVal_4305 (Array Int Int)) (v_ArrVal_4306 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem56#1.offset_19| Int) (v_ArrVal_4307 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4309 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4305))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4307))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4304) .cse10 v_ArrVal_4306)) (.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) |v_ULTIMATE.start_main_#t~mem56#1.offset_19| |v_ULTIMATE.start_main_#t~malloc57#1.base_16|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store .cse5 .cse7 v_ArrVal_4309))) (or (< |v_ULTIMATE.start_main_#t~mem56#1.offset_19| 0) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_16| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4311))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem56#1.offset_19|) (not (= (let ((.cse6 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse2 .cse3) .cse6 (select v_ArrVal_4311 .cse6))) v_ArrVal_4311)) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))) is different from false [2024-11-28 05:16:42,808 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4311 (Array Int Int)) (v_ArrVal_4312 (Array Int Int)) (v_ArrVal_4302 (Array Int Int)) (v_ArrVal_4303 (Array Int Int)) (v_ArrVal_4304 (Array Int Int)) (v_ArrVal_4305 (Array Int Int)) (v_ArrVal_4306 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem56#1.offset_19| Int) (v_ArrVal_4307 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4309 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4302)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_4305))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4307))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4303) .cse9 v_ArrVal_4304) .cse10 v_ArrVal_4306)) (.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) |v_ULTIMATE.start_main_#t~mem56#1.offset_19| |v_ULTIMATE.start_main_#t~malloc57#1.base_16|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (store .cse0 .cse7 v_ArrVal_4309))) (or (< |v_ULTIMATE.start_main_#t~mem56#1.offset_19| 0) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem56#1.offset_19|) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_16| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4311))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse5 .cse4 v_ArrVal_4312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4311 (let ((.cse6 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse3 .cse4) .cse6 (select v_ArrVal_4311 .cse6))))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))) is different from false [2024-11-28 05:16:43,130 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4311 (Array Int Int)) (v_ArrVal_4312 (Array Int Int)) (v_ArrVal_4302 (Array Int Int)) (v_ArrVal_4303 (Array Int Int)) (v_ArrVal_4304 (Array Int Int)) (v_ArrVal_4305 (Array Int Int)) (v_ArrVal_4306 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem56#1.offset_19| Int) (v_ArrVal_4307 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4309 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4302))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4305))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4307))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (store (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4303) .cse10 v_ArrVal_4304) .cse11 v_ArrVal_4306)) (.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) |v_ULTIMATE.start_main_#t~mem56#1.offset_19| |v_ULTIMATE.start_main_#t~malloc57#1.base_16|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store .cse5 .cse7 v_ArrVal_4309))) (or (< |v_ULTIMATE.start_main_#t~mem56#1.offset_19| 0) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_16| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4311))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem56#1.offset_19|) (not (= v_ArrVal_4311 (let ((.cse6 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse2 .cse3) .cse6 (select v_ArrVal_4311 .cse6))))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))) is different from false [2024-11-28 05:16:43,781 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem56#1.offset_19| Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_16| Int) (v_ArrVal_4300 (Array Int Int)) (v_ArrVal_4311 (Array Int Int)) (v_ArrVal_4301 (Array Int Int)) (v_ArrVal_4312 (Array Int Int)) (v_ArrVal_4302 (Array Int Int)) (v_ArrVal_4303 (Array Int Int)) (v_ArrVal_4304 (Array Int Int)) (v_ArrVal_4305 (Array Int Int)) (v_ArrVal_4306 (Array Int Int)) (v_ArrVal_4307 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4309 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_4301)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_4302))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4305))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4307))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_4300) .cse9 v_ArrVal_4303) .cse10 v_ArrVal_4304) .cse11 v_ArrVal_4306)) (.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) |v_ULTIMATE.start_main_#t~mem56#1.offset_19| |v_ULTIMATE.start_main_#t~malloc57#1.base_16|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store .cse3 .cse7 v_ArrVal_4309))) (or (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4311 .cse2))) v_ArrVal_4311)) (< |v_ULTIMATE.start_main_#t~mem56#1.offset_19| 0) (< (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~mem56#1.offset_19|) (= (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4311))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse6 .cse1 v_ArrVal_4312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) |v_ULTIMATE.start_main_#t~malloc57#1.base_16|) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))) is different from false [2024-11-28 05:16:44,139 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem56#1.offset_19| Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_16| Int) (v_ArrVal_4300 (Array Int Int)) (v_ArrVal_4311 (Array Int Int)) (v_ArrVal_4301 (Array Int Int)) (v_ArrVal_4312 (Array Int Int)) (v_ArrVal_4302 (Array Int Int)) (v_ArrVal_4303 (Array Int Int)) (v_ArrVal_4304 (Array Int Int)) (v_ArrVal_4305 (Array Int Int)) (v_ArrVal_4306 (Array Int Int)) (v_ArrVal_4307 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4309 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse8 v_ArrVal_4301))) (let ((.cse9 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse9 v_ArrVal_4302))) (let ((.cse10 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse10 v_ArrVal_4305))) (let ((.cse11 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse11 v_ArrVal_4307))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse0 (store .cse12 .cse7 (store (select .cse12 .cse7) |v_ULTIMATE.start_main_#t~mem56#1.offset_19| |v_ULTIMATE.start_main_#t~malloc57#1.base_16|))) (.cse3 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse8 v_ArrVal_4300) .cse9 v_ArrVal_4303) .cse10 v_ArrVal_4304) .cse11 v_ArrVal_4306))) (let ((.cse5 (store .cse3 .cse7 v_ArrVal_4309)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (< |v_ULTIMATE.start_main_#t~mem56#1.offset_19| 0) (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4311 .cse2))) v_ArrVal_4311)) (< (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~mem56#1.offset_19|) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= (select (let ((.cse6 (store .cse0 .cse1 v_ArrVal_4311))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse5 .cse1 v_ArrVal_4312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) |v_ULTIMATE.start_main_#t~malloc57#1.base_16|))))))))))))))) is different from false [2024-11-28 05:16:45,851 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem56#1.offset_19| Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_16| Int) (v_ArrVal_4300 (Array Int Int)) (v_ArrVal_4311 (Array Int Int)) (v_ArrVal_4301 (Array Int Int)) (v_ArrVal_4312 (Array Int Int)) (v_ArrVal_4302 (Array Int Int)) (v_ArrVal_4303 (Array Int Int)) (v_ArrVal_4304 (Array Int Int)) (v_ArrVal_4305 (Array Int Int)) (v_ArrVal_4317 (Array Int Int)) (v_ArrVal_4306 (Array Int Int)) (v_ArrVal_4318 (Array Int Int)) (v_ArrVal_4307 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem58#1.offset_13| Int) (v_ArrVal_4309 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_4318)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_4301))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4302))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4305))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4307))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_4317) .cse9 v_ArrVal_4300) .cse10 v_ArrVal_4303) .cse11 v_ArrVal_4304) .cse12 v_ArrVal_4306)) (.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) |v_ULTIMATE.start_main_#t~mem56#1.offset_19| |v_ULTIMATE.start_main_#t~malloc57#1.base_16|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store .cse3 .cse7 v_ArrVal_4309))) (or (not (= v_ArrVal_4311 (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_13|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4311 .cse2))))) (< (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~mem56#1.offset_19|) (= |v_ULTIMATE.start_main_#t~malloc57#1.base_16| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4311))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse6 .cse1 v_ArrVal_4312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< |v_ULTIMATE.start_main_#t~mem56#1.offset_19| 0) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_13| (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))))) is different from false [2024-11-28 05:16:45,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525815469] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:16:45,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:16:45,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 31 [2024-11-28 05:16:45,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780216465] [2024-11-28 05:16:45,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:16:45,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-28 05:16:45,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:16:45,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-28 05:16:45,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1020, Unknown=14, NotChecked=900, Total=2070 [2024-11-28 05:16:45,867 INFO L87 Difference]: Start difference. First operand 1519 states and 1769 transitions. Second operand has 32 states, 29 states have (on average 6.0344827586206895) internal successors, (175), 32 states have internal predecessors, (175), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:18:40,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:40,182 INFO L93 Difference]: Finished difference Result 1535 states and 1791 transitions. [2024-11-28 05:18:40,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 05:18:40,182 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 6.0344827586206895) internal successors, (175), 32 states have internal predecessors, (175), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2024-11-28 05:18:40,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:40,184 INFO L225 Difference]: With dead ends: 1535 [2024-11-28 05:18:40,184 INFO L226 Difference]: Without dead ends: 1535 [2024-11-28 05:18:40,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=253, Invalid=2037, Unknown=14, NotChecked=1236, Total=3540 [2024-11-28 05:18:40,185 INFO L435 NwaCegarLoop]: 1044 mSDtfsCounter, 1585 mSDsluCounter, 16428 mSDsCounter, 0 mSdLazyCounter, 10162 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 107.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1598 SdHoareTripleChecker+Valid, 17472 SdHoareTripleChecker+Invalid, 10208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 10162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 108.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:18:40,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1598 Valid, 17472 Invalid, 10208 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [46 Valid, 10162 Invalid, 0 Unknown, 0 Unchecked, 108.6s Time] [2024-11-28 05:18:40,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2024-11-28 05:18:40,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1518. [2024-11-28 05:18:40,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1054 states have (on average 1.6518026565464896) internal successors, (1741), 1506 states have internal predecessors, (1741), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (13), 8 states have call predecessors, (13), 12 states have call successors, (13) [2024-11-28 05:18:40,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1768 transitions. [2024-11-28 05:18:40,202 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1768 transitions. Word has length 110 [2024-11-28 05:18:40,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:40,203 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 1768 transitions. [2024-11-28 05:18:40,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 6.0344827586206895) internal successors, (175), 32 states have internal predecessors, (175), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 05:18:40,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1768 transitions. [2024-11-28 05:18:40,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-28 05:18:40,204 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:40,204 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:40,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 05:18:40,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2024-11-28 05:18:40,405 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-28 05:18:40,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:40,405 INFO L85 PathProgramCache]: Analyzing trace with hash -123974045, now seen corresponding path program 1 times [2024-11-28 05:18:40,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:18:40,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498861435] [2024-11-28 05:18:40,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:40,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:18:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:47,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:18:47,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:18:47,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498861435] [2024-11-28 05:18:47,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498861435] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:18:47,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050405157] [2024-11-28 05:18:47,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:47,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:18:47,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:18:47,106 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:18:47,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c78b4a5-0c4a-4f62-ab04-5c782a2cdc84/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 05:18:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:47,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-28 05:18:47,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:18:47,636 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:18:49,111 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:18:49,111 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:18:49,447 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 19 treesize of output 1 [2024-11-28 05:18:49,467 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 1 [2024-11-28 05:18:50,617 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:18:50,618 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 51 treesize of output 48 [2024-11-28 05:18:50,639 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 30 treesize of output 13 [2024-11-28 05:18:51,264 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:18:51,264 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 51 treesize of output 48 [2024-11-28 05:18:51,289 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 30 treesize of output 13 [2024-11-28 05:18:51,953 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:18:51,953 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 51 treesize of output 48 [2024-11-28 05:18:51,975 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 30 treesize of output 13 [2024-11-28 05:18:52,680 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:18:52,681 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 51 treesize of output 48 [2024-11-28 05:18:52,703 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 30 treesize of output 13 [2024-11-28 05:18:53,411 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:18:53,412 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 51 treesize of output 48 [2024-11-28 05:18:53,434 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 30 treesize of output 13 [2024-11-28 05:18:54,107 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:18:55,066 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-11-28 05:18:55,066 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 82 treesize of output 48 [2024-11-28 05:18:55,108 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 33 treesize of output 26 [2024-11-28 05:18:56,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:18:56,160 INFO L349 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2024-11-28 05:18:56,161 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 2 case distinctions, treesize of input 113 treesize of output 70 [2024-11-28 05:18:56,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:18:56,199 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 60 treesize of output 29 [2024-11-28 05:18:57,433 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-28 05:18:57,433 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 52 treesize of output 23 [2024-11-28 05:18:57,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:18:57,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:18:59,298 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base|)) (.cse3 (+ 40 |c_ULTIMATE.start_main_#t~mem58#1.offset|))) (and (forall ((v_ArrVal_4535 (Array Int Int))) (or (forall ((v_ArrVal_4534 (Array Int Int))) (or (< 0 (+ (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4535))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4534) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (not (= v_ArrVal_4534 (store .cse2 .cse3 (select v_ArrVal_4534 .cse3)))))) (not (= (store .cse4 .cse3 (select v_ArrVal_4535 .cse3)) v_ArrVal_4535)))) (forall ((v_ArrVal_4535 (Array Int Int))) (or (not (= (store .cse4 .cse3 (select v_ArrVal_4535 .cse3)) v_ArrVal_4535)) (forall ((v_ArrVal_4534 (Array Int Int))) (or (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4535)) (.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4534))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse7 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< (+ 383 (select (select .cse5 .cse6) .cse7)) (select |c_#length| (select (select .cse8 .cse6) .cse7))))) (not (= v_ArrVal_4534 (store .cse2 .cse3 (select v_ArrVal_4534 .cse3)))))))))) is different from false [2024-11-28 05:18:59,549 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (select |c_#memory_$Pointer$#1.offset| .cse3)) (.cse0 (select |c_#memory_$Pointer$#1.base| .cse3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem58#1.offset_16| Int)) (or (forall ((v_ArrVal_4535 (Array Int Int))) (let ((.cse1 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_16|))) (or (forall ((v_ArrVal_4534 (Array Int Int))) (or (not (= v_ArrVal_4534 (store .cse0 .cse1 (select v_ArrVal_4534 .cse1)))) (< 0 (+ (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_4535))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_4534) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) 1)))) (not (= v_ArrVal_4535 (store .cse5 .cse1 (select v_ArrVal_4535 .cse1))))))) (< |v_ULTIMATE.start_main_#t~mem58#1.offset_16| .cse6))) (forall ((|v_ULTIMATE.start_main_#t~mem58#1.offset_16| Int)) (or (< |v_ULTIMATE.start_main_#t~mem58#1.offset_16| .cse6) (forall ((v_ArrVal_4535 (Array Int Int))) (let ((.cse7 (+ 40 |v_ULTIMATE.start_main_#t~mem58#1.offset_16|))) (or (not (= v_ArrVal_4535 (store .cse5 .cse7 (select v_ArrVal_4535 .cse7)))) (forall ((v_ArrVal_4534 (Array Int Int))) (or (not (= v_ArrVal_4534 (store .cse0 .cse7 (select v_ArrVal_4534 .cse7)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_4535)) (.cse11 (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_4534))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse10 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 383 (select (select .cse8 .cse9) .cse10)) (select |c_#length| (select (select .cse11 .cse9) .cse10)))))))))))))))) is different from false [2024-11-28 05:19:01,450 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 757 treesize of output 664