./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_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_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/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_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/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_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/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 1a17e1f9edfd37607fb472869452b377d4af1281c9808dec0371b4f943952037 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:06:50,711 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:06:50,834 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 02:06:50,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:06:50,848 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:06:50,890 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:06:50,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:06:50,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:06:50,892 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:06:50,892 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:06:50,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:06:50,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:06:50,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:06:50,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:06:50,895 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:06:50,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:06:50,895 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:06:50,896 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:06:50,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:06:50,896 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:06:50,896 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 02:06:50,897 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 02:06:50,897 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 02:06:50,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:06:50,897 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 02:06:50,897 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 02:06:50,897 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:06:50,897 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:06:50,897 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:06:50,898 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:06:50,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:06:50,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:06:50,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:06:50,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:06:50,899 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:06:50,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:06:50,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:06:50,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:06:50,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:06:50,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:06:50,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:06:50,900 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:06:50,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:06:50,900 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:06:50,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:06:50,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:06:50,901 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:06:50,901 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_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/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 -> 1a17e1f9edfd37607fb472869452b377d4af1281c9808dec0371b4f943952037 [2024-11-28 02:06:51,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:06:51,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:06:51,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:06:51,266 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:06:51,266 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:06:51,268 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i [2024-11-28 02:06:54,379 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/data/667913344/0d65fb3482a641f0a48b6ec30ccaddba/FLAG3ca48c6c5 [2024-11-28 02:06:54,949 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:06:54,954 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i [2024-11-28 02:06:54,987 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/data/667913344/0d65fb3482a641f0a48b6ec30ccaddba/FLAG3ca48c6c5 [2024-11-28 02:06:55,474 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/data/667913344/0d65fb3482a641f0a48b6ec30ccaddba [2024-11-28 02:06:55,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:06:55,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:06:55,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:06:55,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:06:55,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:06:55,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:55,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7153072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55, skipping insertion in model container [2024-11-28 02:06:55,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:55,539 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:06:56,176 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 02:06:56,221 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 02:06:56,233 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 02:06:56,241 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 02:06:56,250 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 02:06:56,316 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 02:06:56,320 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 02:06:56,324 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 02:06:56,331 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 02:06:56,383 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 02:06:56,383 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 02:06:56,390 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 02:06:56,391 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 02:06:56,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:06:56,425 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:06:56,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:06:56,591 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:06:56,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56 WrapperNode [2024-11-28 02:06:56,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:06:56,597 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:06:56,597 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:06:56,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:06:56,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (1/1) ... [2024-11-28 02:06:56,632 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (1/1) ... [2024-11-28 02:06:56,757 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2006 [2024-11-28 02:06:56,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:06:56,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:06:56,759 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:06:56,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:06:56,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (1/1) ... [2024-11-28 02:06:56,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (1/1) ... [2024-11-28 02:06:56,789 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (1/1) ... [2024-11-28 02:06:56,999 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 02:06:56,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (1/1) ... [2024-11-28 02:06:56,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (1/1) ... [2024-11-28 02:06:57,083 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (1/1) ... [2024-11-28 02:06:57,086 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (1/1) ... [2024-11-28 02:06:57,118 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (1/1) ... [2024-11-28 02:06:57,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (1/1) ... [2024-11-28 02:06:57,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (1/1) ... [2024-11-28 02:06:57,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:06:57,168 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:06:57,168 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:06:57,168 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:06:57,170 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (1/1) ... [2024-11-28 02:06:57,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:06:57,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:06:57,215 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:06:57,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:06:57,245 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-28 02:06:57,246 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-28 02:06:57,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 02:06:57,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 02:06:57,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 02:06:57,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 02:06:57,246 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 02:06:57,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 02:06:57,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 02:06:57,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 02:06:57,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-28 02:06:57,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-28 02:06:57,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-28 02:06:57,247 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-28 02:06:57,247 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-28 02:06:57,248 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-28 02:06:57,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 02:06:57,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:06:57,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 02:06:57,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 02:06:57,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 02:06:57,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 02:06:57,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 02:06:57,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 02:06:57,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 02:06:57,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 02:06:57,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:06:57,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 02:06:57,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 02:06:57,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:06:57,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:06:57,540 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:06:57,542 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:06:57,570 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:06:57,613 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:06:57,644 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:07:02,161 INFO L? ?]: Removed 1735 outVars from TransFormulas that were not future-live. [2024-11-28 02:07:02,161 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:07:02,251 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:07:02,251 INFO L312 CfgBuilder]: Removed 47 assume(true) statements. [2024-11-28 02:07:02,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:07:02 BoogieIcfgContainer [2024-11-28 02:07:02,252 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:07:02,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:07:02,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:07:02,264 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:07:02,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:06:55" (1/3) ... [2024-11-28 02:07:02,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2714c2cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:07:02, skipping insertion in model container [2024-11-28 02:07:02,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (2/3) ... [2024-11-28 02:07:02,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2714c2cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:07:02, skipping insertion in model container [2024-11-28 02:07:02,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:07:02" (3/3) ... [2024-11-28 02:07:02,268 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test5-1.i [2024-11-28 02:07:02,287 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:07:02,289 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test5-1.i that has 6 procedures, 1749 locations, 1 initial locations, 49 loop locations, and 712 error locations. [2024-11-28 02:07:02,378 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:07:02,393 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;@176f4895, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:07:02,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 712 error locations. [2024-11-28 02:07:02,407 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 02:07:02,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 02:07:02,414 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:02,415 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 02:07:02,415 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 02:07:02,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:02,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2031748298, now seen corresponding path program 1 times [2024-11-28 02:07:02,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:02,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378633201] [2024-11-28 02:07:02,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:02,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:02,582 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 02:07:02,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:02,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378633201] [2024-11-28 02:07:02,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378633201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:02,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:02,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:07:02,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144916771] [2024-11-28 02:07:02,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:02,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 02:07:02,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:02,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 02:07:02,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:07:02,627 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 02:07:02,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:02,764 INFO L93 Difference]: Finished difference Result 1719 states and 1979 transitions. [2024-11-28 02:07:02,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 02:07:02,766 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 02:07:02,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:02,797 INFO L225 Difference]: With dead ends: 1719 [2024-11-28 02:07:02,797 INFO L226 Difference]: Without dead ends: 1717 [2024-11-28 02:07:02,799 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 02:07:02,803 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 02:07:02,804 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 02:07:02,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2024-11-28 02:07:02,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1717. [2024-11-28 02:07:02,948 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 02:07:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 1977 transitions. [2024-11-28 02:07:02,974 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 1977 transitions. Word has length 6 [2024-11-28 02:07:02,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:02,974 INFO L471 AbstractCegarLoop]: Abstraction has 1717 states and 1977 transitions. [2024-11-28 02:07:02,975 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 02:07:02,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 1977 transitions. [2024-11-28 02:07:02,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 02:07:02,975 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:02,975 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 02:07:02,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:07:02,976 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 02:07:02,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:02,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1954605546, now seen corresponding path program 1 times [2024-11-28 02:07:02,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:02,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132777894] [2024-11-28 02:07:02,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:02,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:03,166 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 02:07:03,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:03,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132777894] [2024-11-28 02:07:03,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132777894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:03,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:03,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:07:03,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636749599] [2024-11-28 02:07:03,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:03,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:07:03,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:03,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:07:03,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:03,169 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 02:07:04,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:04,735 INFO L93 Difference]: Finished difference Result 1947 states and 2295 transitions. [2024-11-28 02:07:04,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:07:04,736 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 02:07:04,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:04,745 INFO L225 Difference]: With dead ends: 1947 [2024-11-28 02:07:04,745 INFO L226 Difference]: Without dead ends: 1947 [2024-11-28 02:07:04,746 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 02:07:04,747 INFO L435 NwaCegarLoop]: 1592 mSDtfsCounter, 1738 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:04,747 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.5s Time] [2024-11-28 02:07:04,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2024-11-28 02:07:04,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1625. [2024-11-28 02:07:04,790 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 02:07:04,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 1885 transitions. [2024-11-28 02:07:04,804 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 1885 transitions. Word has length 6 [2024-11-28 02:07:04,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:04,805 INFO L471 AbstractCegarLoop]: Abstraction has 1625 states and 1885 transitions. [2024-11-28 02:07:04,805 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 02:07:04,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 1885 transitions. [2024-11-28 02:07:04,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 02:07:04,806 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:04,806 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 02:07:04,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:07:04,807 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 02:07:04,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:04,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1954605547, now seen corresponding path program 1 times [2024-11-28 02:07:04,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:04,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489188023] [2024-11-28 02:07:04,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:04,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:04,997 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 02:07:04,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:04,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489188023] [2024-11-28 02:07:04,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489188023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:04,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:04,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:07:04,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606159777] [2024-11-28 02:07:04,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:04,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:07:04,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:04,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:07:04,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:04,999 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 02:07:06,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:06,732 INFO L93 Difference]: Finished difference Result 2363 states and 2787 transitions. [2024-11-28 02:07:06,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:07:06,733 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 02:07:06,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:06,745 INFO L225 Difference]: With dead ends: 2363 [2024-11-28 02:07:06,745 INFO L226 Difference]: Without dead ends: 2363 [2024-11-28 02:07:06,746 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 02:07:06,746 INFO L435 NwaCegarLoop]: 1956 mSDtfsCounter, 1218 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:06,748 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.6s Time] [2024-11-28 02:07:06,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2024-11-28 02:07:06,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 1888. [2024-11-28 02:07:06,812 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 02:07:06,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2359 transitions. [2024-11-28 02:07:06,824 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2359 transitions. Word has length 6 [2024-11-28 02:07:06,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:06,824 INFO L471 AbstractCegarLoop]: Abstraction has 1888 states and 2359 transitions. [2024-11-28 02:07:06,824 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 02:07:06,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2359 transitions. [2024-11-28 02:07:06,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 02:07:06,825 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:06,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 02:07:06,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:07:06,826 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 02:07:06,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:06,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1957151634, now seen corresponding path program 1 times [2024-11-28 02:07:06,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:06,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654585840] [2024-11-28 02:07:06,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:06,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:06,909 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 02:07:06,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:06,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654585840] [2024-11-28 02:07:06,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654585840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:06,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:06,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:07:06,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959487079] [2024-11-28 02:07:06,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:06,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:07:06,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:06,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:07:06,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:06,913 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 02:07:07,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:07,016 INFO L93 Difference]: Finished difference Result 3757 states and 4699 transitions. [2024-11-28 02:07:07,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:07:07,017 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 02:07:07,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:07,035 INFO L225 Difference]: With dead ends: 3757 [2024-11-28 02:07:07,035 INFO L226 Difference]: Without dead ends: 3757 [2024-11-28 02:07:07,036 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 02:07:07,037 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 02:07:07,039 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 02:07:07,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3757 states. [2024-11-28 02:07:07,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3757 to 1890. [2024-11-28 02:07:07,110 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 02:07:07,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2361 transitions. [2024-11-28 02:07:07,121 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2361 transitions. Word has length 6 [2024-11-28 02:07:07,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:07,121 INFO L471 AbstractCegarLoop]: Abstraction has 1890 states and 2361 transitions. [2024-11-28 02:07:07,122 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 02:07:07,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2361 transitions. [2024-11-28 02:07:07,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 02:07:07,122 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:07,122 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:07,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 02:07:07,122 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 02:07:07,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:07,123 INFO L85 PathProgramCache]: Analyzing trace with hash 748226775, now seen corresponding path program 1 times [2024-11-28 02:07:07,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:07,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433146197] [2024-11-28 02:07:07,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:07,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:07,251 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 02:07:07,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:07,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433146197] [2024-11-28 02:07:07,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433146197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:07,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:07,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:07:07,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396401240] [2024-11-28 02:07:07,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:07,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:07:07,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:07,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:07:07,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:07:07,253 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 02:07:09,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:09,049 INFO L93 Difference]: Finished difference Result 1917 states and 2415 transitions. [2024-11-28 02:07:09,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:07:09,049 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 02:07:09,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:09,061 INFO L225 Difference]: With dead ends: 1917 [2024-11-28 02:07:09,061 INFO L226 Difference]: Without dead ends: 1917 [2024-11-28 02:07:09,061 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 02:07:09,062 INFO L435 NwaCegarLoop]: 1162 mSDtfsCounter, 2006 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:09,063 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.7s Time] [2024-11-28 02:07:09,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2024-11-28 02:07:09,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1867. [2024-11-28 02:07:09,109 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 02:07:09,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2338 transitions. [2024-11-28 02:07:09,118 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 2338 transitions. Word has length 12 [2024-11-28 02:07:09,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:09,118 INFO L471 AbstractCegarLoop]: Abstraction has 1867 states and 2338 transitions. [2024-11-28 02:07:09,118 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 02:07:09,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2338 transitions. [2024-11-28 02:07:09,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 02:07:09,119 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:09,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:09,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 02:07:09,120 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 02:07:09,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:09,120 INFO L85 PathProgramCache]: Analyzing trace with hash 748226776, now seen corresponding path program 1 times [2024-11-28 02:07:09,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:09,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925004691] [2024-11-28 02:07:09,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:09,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:09,235 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 02:07:09,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:09,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925004691] [2024-11-28 02:07:09,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925004691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:09,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:09,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:07:09,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577569340] [2024-11-28 02:07:09,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:09,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:07:09,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:09,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:07:09,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:09,238 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 02:07:09,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:09,279 INFO L93 Difference]: Finished difference Result 1792 states and 2235 transitions. [2024-11-28 02:07:09,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:07:09,279 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 02:07:09,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:09,285 INFO L225 Difference]: With dead ends: 1792 [2024-11-28 02:07:09,285 INFO L226 Difference]: Without dead ends: 1792 [2024-11-28 02:07:09,285 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 02:07:09,287 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 02:07:09,288 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 02:07:09,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2024-11-28 02:07:09,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1792. [2024-11-28 02:07:09,322 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 02:07:09,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2235 transitions. [2024-11-28 02:07:09,327 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2235 transitions. Word has length 12 [2024-11-28 02:07:09,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:09,328 INFO L471 AbstractCegarLoop]: Abstraction has 1792 states and 2235 transitions. [2024-11-28 02:07:09,328 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 02:07:09,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2235 transitions. [2024-11-28 02:07:09,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-28 02:07:09,328 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:09,328 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:09,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 02:07:09,329 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 02:07:09,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:09,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1786670129, now seen corresponding path program 1 times [2024-11-28 02:07:09,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:09,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514144531] [2024-11-28 02:07:09,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:09,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:09,403 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 02:07:09,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:09,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514144531] [2024-11-28 02:07:09,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514144531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:09,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:09,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:07:09,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145896538] [2024-11-28 02:07:09,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:09,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:07:09,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:09,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:07:09,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:07:09,406 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 02:07:09,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:09,495 INFO L93 Difference]: Finished difference Result 1777 states and 2213 transitions. [2024-11-28 02:07:09,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:07:09,496 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 02:07:09,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:09,502 INFO L225 Difference]: With dead ends: 1777 [2024-11-28 02:07:09,502 INFO L226 Difference]: Without dead ends: 1777 [2024-11-28 02:07:09,502 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 02:07:09,504 INFO L435 NwaCegarLoop]: 1699 mSDtfsCounter, 45 mSDsluCounter, 3375 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 02:07:09,504 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 02:07:09,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2024-11-28 02:07:09,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1777. [2024-11-28 02:07:09,540 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 02:07:09,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2213 transitions. [2024-11-28 02:07:09,546 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2213 transitions. Word has length 14 [2024-11-28 02:07:09,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:09,547 INFO L471 AbstractCegarLoop]: Abstraction has 1777 states and 2213 transitions. [2024-11-28 02:07:09,547 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 02:07:09,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2213 transitions. [2024-11-28 02:07:09,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 02:07:09,549 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:09,549 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 02:07:09,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 02:07:09,549 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 02:07:09,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:09,550 INFO L85 PathProgramCache]: Analyzing trace with hash 393992639, now seen corresponding path program 1 times [2024-11-28 02:07:09,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:09,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560800725] [2024-11-28 02:07:09,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:09,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:09,899 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 02:07:09,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:09,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560800725] [2024-11-28 02:07:09,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560800725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:09,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:09,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:07:09,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078794488] [2024-11-28 02:07:09,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:09,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:07:09,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:09,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:07:09,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:07:09,902 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 02:07:12,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:12,034 INFO L93 Difference]: Finished difference Result 2298 states and 2714 transitions. [2024-11-28 02:07:12,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:07:12,034 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 02:07:12,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:12,044 INFO L225 Difference]: With dead ends: 2298 [2024-11-28 02:07:12,044 INFO L226 Difference]: Without dead ends: 2298 [2024-11-28 02:07:12,044 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 02:07:12,045 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.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:12,045 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.0s Time] [2024-11-28 02:07:12,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2024-11-28 02:07:12,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 1773. [2024-11-28 02:07:12,095 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 02:07:12,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2209 transitions. [2024-11-28 02:07:12,102 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2209 transitions. Word has length 28 [2024-11-28 02:07:12,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:12,102 INFO L471 AbstractCegarLoop]: Abstraction has 1773 states and 2209 transitions. [2024-11-28 02:07:12,102 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 02:07:12,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2209 transitions. [2024-11-28 02:07:12,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-28 02:07:12,104 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:12,104 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 02:07:12,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 02:07:12,104 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 02:07:12,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:12,105 INFO L85 PathProgramCache]: Analyzing trace with hash 537217013, now seen corresponding path program 1 times [2024-11-28 02:07:12,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:12,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100851498] [2024-11-28 02:07:12,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:12,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:12,307 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 02:07:12,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:12,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100851498] [2024-11-28 02:07:12,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100851498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:12,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:12,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:07:12,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281057466] [2024-11-28 02:07:12,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:12,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:07:12,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:12,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:07:12,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:07:12,308 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 02:07:12,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:12,383 INFO L93 Difference]: Finished difference Result 1767 states and 2199 transitions. [2024-11-28 02:07:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:07:12,384 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 02:07:12,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:12,390 INFO L225 Difference]: With dead ends: 1767 [2024-11-28 02:07:12,391 INFO L226 Difference]: Without dead ends: 1767 [2024-11-28 02:07:12,391 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 02:07:12,393 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.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:12,393 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.0s Time] [2024-11-28 02:07:12,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2024-11-28 02:07:12,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1767. [2024-11-28 02:07:12,431 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 02:07:12,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2199 transitions. [2024-11-28 02:07:12,436 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2199 transitions. Word has length 62 [2024-11-28 02:07:12,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:12,438 INFO L471 AbstractCegarLoop]: Abstraction has 1767 states and 2199 transitions. [2024-11-28 02:07:12,439 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 02:07:12,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2199 transitions. [2024-11-28 02:07:12,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 02:07:12,441 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:12,441 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 02:07:12,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 02:07:12,441 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 02:07:12,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:12,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1829680703, now seen corresponding path program 1 times [2024-11-28 02:07:12,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:12,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135405523] [2024-11-28 02:07:12,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:12,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:12,672 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 02:07:12,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:12,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135405523] [2024-11-28 02:07:12,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135405523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:12,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:12,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:07:12,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734179065] [2024-11-28 02:07:12,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:12,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:07:12,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:12,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:07:12,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:12,675 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 02:07:12,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:12,739 INFO L93 Difference]: Finished difference Result 1860 states and 2319 transitions. [2024-11-28 02:07:12,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:07:12,740 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 02:07:12,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:12,749 INFO L225 Difference]: With dead ends: 1860 [2024-11-28 02:07:12,749 INFO L226 Difference]: Without dead ends: 1860 [2024-11-28 02:07:12,749 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 02:07:12,751 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 02:07:12,754 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 02:07:12,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2024-11-28 02:07:12,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1860. [2024-11-28 02:07:12,788 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 02:07:12,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 2319 transitions. [2024-11-28 02:07:12,794 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 2319 transitions. Word has length 70 [2024-11-28 02:07:12,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:12,796 INFO L471 AbstractCegarLoop]: Abstraction has 1860 states and 2319 transitions. [2024-11-28 02:07:12,797 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 02:07:12,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 2319 transitions. [2024-11-28 02:07:12,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-28 02:07:12,801 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:12,801 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 02:07:12,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 02:07:12,802 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 02:07:12,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:12,802 INFO L85 PathProgramCache]: Analyzing trace with hash -696902437, now seen corresponding path program 1 times [2024-11-28 02:07:12,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:12,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590109348] [2024-11-28 02:07:12,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:12,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:13,568 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 02:07:13,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:13,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590109348] [2024-11-28 02:07:13,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590109348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:13,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:13,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:07:13,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078411205] [2024-11-28 02:07:13,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:13,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:07:13,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:13,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:07:13,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:07:13,572 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 02:07:15,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:15,221 INFO L93 Difference]: Finished difference Result 1776 states and 2235 transitions. [2024-11-28 02:07:15,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:07:15,221 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 02:07:15,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:15,229 INFO L225 Difference]: With dead ends: 1776 [2024-11-28 02:07:15,229 INFO L226 Difference]: Without dead ends: 1776 [2024-11-28 02:07:15,229 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 02:07:15,230 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 3048 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:15,230 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.6s Time] [2024-11-28 02:07:15,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2024-11-28 02:07:15,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1503. [2024-11-28 02:07:15,261 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 02:07:15,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1751 transitions. [2024-11-28 02:07:15,266 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1751 transitions. Word has length 73 [2024-11-28 02:07:15,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:15,266 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 1751 transitions. [2024-11-28 02:07:15,266 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 02:07:15,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1751 transitions. [2024-11-28 02:07:15,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-28 02:07:15,269 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:15,269 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 02:07:15,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 02:07:15,270 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 02:07:15,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:15,270 INFO L85 PathProgramCache]: Analyzing trace with hash 567023701, now seen corresponding path program 1 times [2024-11-28 02:07:15,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:15,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935178856] [2024-11-28 02:07:15,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:15,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:15,962 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 02:07:15,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:15,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935178856] [2024-11-28 02:07:15,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935178856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:15,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:15,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:07:15,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105733234] [2024-11-28 02:07:15,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:15,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:07:15,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:15,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:07:15,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:07:15,964 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 02:07:17,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:17,569 INFO L93 Difference]: Finished difference Result 1502 states and 1750 transitions. [2024-11-28 02:07:17,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:07:17,570 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 02:07:17,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:17,574 INFO L225 Difference]: With dead ends: 1502 [2024-11-28 02:07:17,575 INFO L226 Difference]: Without dead ends: 1502 [2024-11-28 02:07:17,575 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 02:07:17,575 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 2 mSDsluCounter, 3180 mSDsCounter, 0 mSdLazyCounter, 1699 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:17,576 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.5s Time] [2024-11-28 02:07:17,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2024-11-28 02:07:17,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1502. [2024-11-28 02:07:17,601 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 02:07:17,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1750 transitions. [2024-11-28 02:07:17,604 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1750 transitions. Word has length 78 [2024-11-28 02:07:17,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:17,605 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 1750 transitions. [2024-11-28 02:07:17,605 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 02:07:17,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1750 transitions. [2024-11-28 02:07:17,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-28 02:07:17,606 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:17,606 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 02:07:17,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 02:07:17,607 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 02:07:17,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:17,607 INFO L85 PathProgramCache]: Analyzing trace with hash 567023700, now seen corresponding path program 1 times [2024-11-28 02:07:17,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:17,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851037400] [2024-11-28 02:07:17,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:17,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:18,055 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 02:07:18,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:18,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851037400] [2024-11-28 02:07:18,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851037400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:18,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:18,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:07:18,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772166414] [2024-11-28 02:07:18,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:18,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:07:18,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:18,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:07:18,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:07:18,058 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 02:07:19,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:19,557 INFO L93 Difference]: Finished difference Result 1501 states and 1749 transitions. [2024-11-28 02:07:19,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:07:19,557 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 02:07:19,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:19,562 INFO L225 Difference]: With dead ends: 1501 [2024-11-28 02:07:19,562 INFO L226 Difference]: Without dead ends: 1501 [2024-11-28 02:07:19,563 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 02:07:19,564 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 1 mSDsluCounter, 3158 mSDsCounter, 0 mSdLazyCounter, 1718 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:19,564 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.4s Time] [2024-11-28 02:07:19,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2024-11-28 02:07:19,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1501. [2024-11-28 02:07:19,585 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 02:07:19,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1749 transitions. [2024-11-28 02:07:19,588 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1749 transitions. Word has length 78 [2024-11-28 02:07:19,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:19,588 INFO L471 AbstractCegarLoop]: Abstraction has 1501 states and 1749 transitions. [2024-11-28 02:07:19,589 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 02:07:19,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1749 transitions. [2024-11-28 02:07:19,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-28 02:07:19,590 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:19,590 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 02:07:19,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 02:07:19,590 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 02:07:19,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:19,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2048500027, now seen corresponding path program 1 times [2024-11-28 02:07:19,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:19,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418998848] [2024-11-28 02:07:19,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:19,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:19,871 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 02:07:19,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:19,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418998848] [2024-11-28 02:07:19,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418998848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:19,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:19,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:07:19,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488860026] [2024-11-28 02:07:19,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:19,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:07:19,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:19,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:07:19,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:07:19,873 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 02:07:21,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:21,639 INFO L93 Difference]: Finished difference Result 1513 states and 1767 transitions. [2024-11-28 02:07:21,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:07:21,639 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 02:07:21,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:21,646 INFO L225 Difference]: With dead ends: 1513 [2024-11-28 02:07:21,646 INFO L226 Difference]: Without dead ends: 1513 [2024-11-28 02:07:21,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:07:21,648 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 13 mSDsluCounter, 4846 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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 02:07:21,648 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 02:07:21,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2024-11-28 02:07:21,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1507. [2024-11-28 02:07:21,686 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 02:07:21,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1762 transitions. [2024-11-28 02:07:21,691 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1762 transitions. Word has length 86 [2024-11-28 02:07:21,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:21,692 INFO L471 AbstractCegarLoop]: Abstraction has 1507 states and 1762 transitions. [2024-11-28 02:07:21,692 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 02:07:21,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1762 transitions. [2024-11-28 02:07:21,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-28 02:07:21,693 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:21,694 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 02:07:21,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 02:07:21,694 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 02:07:21,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:21,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2048500028, now seen corresponding path program 1 times [2024-11-28 02:07:21,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:21,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129354303] [2024-11-28 02:07:21,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:21,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:22,410 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 02:07:22,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:22,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129354303] [2024-11-28 02:07:22,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129354303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:22,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:22,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:07:22,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211827836] [2024-11-28 02:07:22,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:22,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:07:22,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:22,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:07:22,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:07:22,413 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 02:07:24,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:24,588 INFO L93 Difference]: Finished difference Result 1507 states and 1761 transitions. [2024-11-28 02:07:24,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:07:24,588 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 02:07:24,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:24,594 INFO L225 Difference]: With dead ends: 1507 [2024-11-28 02:07:24,594 INFO L226 Difference]: Without dead ends: 1507 [2024-11-28 02:07:24,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:07:24,595 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 8 mSDsluCounter, 4526 mSDsCounter, 0 mSdLazyCounter, 1969 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:24,595 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.1s Time] [2024-11-28 02:07:24,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2024-11-28 02:07:24,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2024-11-28 02:07:24,620 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 02:07:24,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1761 transitions. [2024-11-28 02:07:24,623 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1761 transitions. Word has length 86 [2024-11-28 02:07:24,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:24,624 INFO L471 AbstractCegarLoop]: Abstraction has 1507 states and 1761 transitions. [2024-11-28 02:07:24,624 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 02:07:24,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1761 transitions. [2024-11-28 02:07:24,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-28 02:07:24,625 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:24,625 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 02:07:24,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 02:07:24,626 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 02:07:24,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:24,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1457933393, now seen corresponding path program 1 times [2024-11-28 02:07:24,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:24,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552976779] [2024-11-28 02:07:24,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:24,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:25,343 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 02:07:25,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:25,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552976779] [2024-11-28 02:07:25,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552976779] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:07:25,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139385099] [2024-11-28 02:07:25,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:25,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:25,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:07:25,350 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:07:25,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:07:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:25,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 02:07:25,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:07:25,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 02:07:25,918 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:07:25,919 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 02:07:25,940 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 02:07:26,086 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:07:26,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 42 treesize of output 41 [2024-11-28 02:07:26,137 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 02:07:26,141 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 02:07:26,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:07:26,220 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-28 02:07:26,221 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 02:07:26,231 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 02:07:26,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139385099] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:07:26,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:07:26,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2024-11-28 02:07:26,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145319171] [2024-11-28 02:07:26,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:07:26,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 02:07:26,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:26,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 02:07:26,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2024-11-28 02:07:26,237 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 02:07:29,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:29,971 INFO L93 Difference]: Finished difference Result 1506 states and 1760 transitions. [2024-11-28 02:07:29,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:07:29,972 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 02:07:29,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:29,978 INFO L225 Difference]: With dead ends: 1506 [2024-11-28 02:07:29,978 INFO L226 Difference]: Without dead ends: 1506 [2024-11-28 02:07:29,978 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 02:07:29,979 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 02:07:29,979 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 02:07:29,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2024-11-28 02:07:30,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2024-11-28 02:07:30,003 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 02:07:30,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 1760 transitions. [2024-11-28 02:07:30,006 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 1760 transitions. Word has length 87 [2024-11-28 02:07:30,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:30,007 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 1760 transitions. [2024-11-28 02:07:30,007 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 02:07:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 1760 transitions. [2024-11-28 02:07:30,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-28 02:07:30,008 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:30,008 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 02:07:30,022 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 02:07:30,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-28 02:07:30,209 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 02:07:30,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:30,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1457933392, now seen corresponding path program 1 times [2024-11-28 02:07:30,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:30,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898574325] [2024-11-28 02:07:30,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:30,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:31,194 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 02:07:31,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:31,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898574325] [2024-11-28 02:07:31,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898574325] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:07:31,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396054555] [2024-11-28 02:07:31,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:31,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:31,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:07:31,196 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:07:31,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:07:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:31,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-28 02:07:31,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:07:31,510 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 02:07:31,689 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 02:07:31,706 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:07:31,707 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 02:07:31,748 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 02:07:31,764 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 02:07:31,895 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 02:07:31,902 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 02:07:32,089 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:07:32,089 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 02:07:32,097 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 02:07:32,212 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 02:07:32,221 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 02:07:32,251 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 02:07:32,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:07:32,405 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 02:07:32,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396054555] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:07:32,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:07:32,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-28 02:07:32,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100221449] [2024-11-28 02:07:32,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:07:32,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 02:07:32,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:32,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 02:07:32,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2024-11-28 02:07:32,412 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 02:07:37,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:37,930 INFO L93 Difference]: Finished difference Result 1513 states and 1767 transitions. [2024-11-28 02:07:37,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:07:37,931 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 02:07:37,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:37,935 INFO L225 Difference]: With dead ends: 1513 [2024-11-28 02:07:37,935 INFO L226 Difference]: Without dead ends: 1513 [2024-11-28 02:07:37,936 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 02:07:37,936 INFO L435 NwaCegarLoop]: 1052 mSDtfsCounter, 1544 mSDsluCounter, 7870 mSDsCounter, 0 mSdLazyCounter, 7333 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 8922 SdHoareTripleChecker+Invalid, 7376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 7333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:37,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1559 Valid, 8922 Invalid, 7376 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [43 Valid, 7333 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-28 02:07:37,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2024-11-28 02:07:37,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1504. [2024-11-28 02:07:37,969 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 02:07:37,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1752 transitions. [2024-11-28 02:07:37,974 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1752 transitions. Word has length 87 [2024-11-28 02:07:37,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:37,974 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 1752 transitions. [2024-11-28 02:07:37,975 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 02:07:37,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1752 transitions. [2024-11-28 02:07:37,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-28 02:07:37,976 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:37,976 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 02:07:37,989 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 02:07:38,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:38,180 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 02:07:38,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:38,181 INFO L85 PathProgramCache]: Analyzing trace with hash -325374910, now seen corresponding path program 1 times [2024-11-28 02:07:38,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:38,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041871953] [2024-11-28 02:07:38,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:38,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:38,893 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 02:07:38,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:38,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041871953] [2024-11-28 02:07:38,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041871953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:38,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:38,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 02:07:38,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155580719] [2024-11-28 02:07:38,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:38,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 02:07:38,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:38,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 02:07:38,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-28 02:07:38,895 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 02:07:42,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:42,614 INFO L93 Difference]: Finished difference Result 1517 states and 1771 transitions. [2024-11-28 02:07:42,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:07:42,615 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 02:07:42,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:42,617 INFO L225 Difference]: With dead ends: 1517 [2024-11-28 02:07:42,618 INFO L226 Difference]: Without dead ends: 1517 [2024-11-28 02:07:42,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-28 02:07:42,618 INFO L435 NwaCegarLoop]: 1046 mSDtfsCounter, 1550 mSDsluCounter, 8161 mSDsCounter, 0 mSdLazyCounter, 5416 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s 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.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:42,619 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.5s Time] [2024-11-28 02:07:42,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-11-28 02:07:42,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1513. [2024-11-28 02:07:42,641 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 02:07:42,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1763 transitions. [2024-11-28 02:07:42,645 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1763 transitions. Word has length 89 [2024-11-28 02:07:42,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:42,646 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1763 transitions. [2024-11-28 02:07:42,646 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 02:07:42,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1763 transitions. [2024-11-28 02:07:42,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-28 02:07:42,647 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:42,647 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 02:07:42,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 02:07:42,647 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 02:07:42,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:42,648 INFO L85 PathProgramCache]: Analyzing trace with hash -325374909, now seen corresponding path program 1 times [2024-11-28 02:07:42,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:42,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062984678] [2024-11-28 02:07:42,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:42,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:43,549 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 02:07:43,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:43,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062984678] [2024-11-28 02:07:43,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062984678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:43,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:43,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 02:07:43,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568615184] [2024-11-28 02:07:43,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:43,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 02:07:43,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:43,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 02:07:43,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 02:07:43,552 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 02:07:48,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:48,115 INFO L93 Difference]: Finished difference Result 1516 states and 1770 transitions. [2024-11-28 02:07:48,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:07:48,115 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 02:07:48,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:48,119 INFO L225 Difference]: With dead ends: 1516 [2024-11-28 02:07:48,119 INFO L226 Difference]: Without dead ends: 1516 [2024-11-28 02:07:48,119 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 02:07:48,120 INFO L435 NwaCegarLoop]: 1053 mSDtfsCounter, 1544 mSDsluCounter, 7056 mSDsCounter, 0 mSdLazyCounter, 6475 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s 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.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:48,120 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.4s Time] [2024-11-28 02:07:48,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-11-28 02:07:48,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1513. [2024-11-28 02:07:48,186 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 02:07:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1762 transitions. [2024-11-28 02:07:48,190 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1762 transitions. Word has length 89 [2024-11-28 02:07:48,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:48,190 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1762 transitions. [2024-11-28 02:07:48,190 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 02:07:48,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1762 transitions. [2024-11-28 02:07:48,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-28 02:07:48,192 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:48,192 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 02:07:48,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 02:07:48,192 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 02:07:48,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:48,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1711183182, now seen corresponding path program 1 times [2024-11-28 02:07:48,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:48,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972270100] [2024-11-28 02:07:48,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:48,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:48,952 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 02:07:48,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:48,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972270100] [2024-11-28 02:07:48,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972270100] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:07:48,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719439848] [2024-11-28 02:07:48,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:48,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:48,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:07:48,956 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:07:48,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 02:07:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:49,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-28 02:07:49,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:07:49,264 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 02:07:49,421 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:07:49,421 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 02:07:49,429 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 02:07:49,499 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:07:49,500 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 02:07:49,559 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:07:49,560 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 02:07:49,575 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 02:07:49,579 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 02:07:49,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:07:49,634 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 02:07:49,693 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-28 02:07:49,694 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 02:07:49,702 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 02:07:49,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719439848] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:07:49,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:07:49,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2024-11-28 02:07:49,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312416058] [2024-11-28 02:07:49,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:07:49,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:07:49,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:49,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:07:49,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=225, Unknown=6, NotChecked=62, Total=342 [2024-11-28 02:07:49,706 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 02:07:54,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:07:54,185 INFO L93 Difference]: Finished difference Result 1515 states and 1769 transitions. [2024-11-28 02:07:54,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:07:54,185 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 02:07:54,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:07:54,189 INFO L225 Difference]: With dead ends: 1515 [2024-11-28 02:07:54,189 INFO L226 Difference]: Without dead ends: 1515 [2024-11-28 02:07:54,189 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 02:07:54,190 INFO L435 NwaCegarLoop]: 1046 mSDtfsCounter, 1533 mSDsluCounter, 11207 mSDsCounter, 0 mSdLazyCounter, 7185 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 12253 SdHoareTripleChecker+Invalid, 7210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 7185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:07:54,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 12253 Invalid, 7210 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 7185 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-28 02:07:54,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-28 02:07:54,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1512. [2024-11-28 02:07:54,216 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 02:07:54,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1761 transitions. [2024-11-28 02:07:54,220 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1761 transitions. Word has length 90 [2024-11-28 02:07:54,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:07:54,222 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 1761 transitions. [2024-11-28 02:07:54,222 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 02:07:54,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1761 transitions. [2024-11-28 02:07:54,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-28 02:07:54,224 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:54,224 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 02:07:54,236 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 02:07:54,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:54,425 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 02:07:54,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:54,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1711183183, now seen corresponding path program 1 times [2024-11-28 02:07:54,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:54,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481502934] [2024-11-28 02:07:54,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:54,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:55,392 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 02:07:55,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:55,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481502934] [2024-11-28 02:07:55,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481502934] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:07:55,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831542681] [2024-11-28 02:07:55,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:55,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:55,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:07:55,396 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:07:55,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 02:07:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:55,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-28 02:07:55,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:07:55,716 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 02:07:55,853 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:07:55,853 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 02:07:55,864 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 02:07:55,875 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 02:07:55,882 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 02:07:55,948 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 02:07:55,953 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 02:07:56,068 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:07:56,068 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 02:07:56,073 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 02:07:56,154 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:07:56,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 02:07:56,160 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 02:07:56,183 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 02:07:56,187 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 02:07:56,192 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 02:07:56,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:07:56,262 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 02:07:56,278 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 02:07:56,354 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 02:07:56,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831542681] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:07:56,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:07:56,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2024-11-28 02:07:56,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560737786] [2024-11-28 02:07:56,357 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:07:56,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:07:56,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:56,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:07:56,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=256, Unknown=3, NotChecked=102, Total=420 [2024-11-28 02:07:56,358 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 02:08:01,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:01,918 INFO L93 Difference]: Finished difference Result 1514 states and 1768 transitions. [2024-11-28 02:08:01,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:08:01,919 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 02:08:01,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:01,922 INFO L225 Difference]: With dead ends: 1514 [2024-11-28 02:08:01,922 INFO L226 Difference]: Without dead ends: 1514 [2024-11-28 02:08:01,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=420, Unknown=3, NotChecked=132, Total=650 [2024-11-28 02:08:01,923 INFO L435 NwaCegarLoop]: 1051 mSDtfsCounter, 1540 mSDsluCounter, 6854 mSDsCounter, 0 mSdLazyCounter, 6710 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s 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.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:01,924 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.3s Time] [2024-11-28 02:08:01,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2024-11-28 02:08:01,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1502. [2024-11-28 02:08:01,940 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 02:08:01,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1750 transitions. [2024-11-28 02:08:01,943 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1750 transitions. Word has length 90 [2024-11-28 02:08:01,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:01,944 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 1750 transitions. [2024-11-28 02:08:01,944 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 02:08:01,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1750 transitions. [2024-11-28 02:08:01,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-28 02:08:01,945 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:01,945 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 02:08:01,957 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 02:08:02,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:08:02,146 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 02:08:02,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:02,147 INFO L85 PathProgramCache]: Analyzing trace with hash 497879810, now seen corresponding path program 1 times [2024-11-28 02:08:02,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:02,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484861390] [2024-11-28 02:08:02,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:02,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:02,847 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 02:08:02,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:02,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484861390] [2024-11-28 02:08:02,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484861390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:08:02,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:08:02,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 02:08:02,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876112019] [2024-11-28 02:08:02,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:08:02,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 02:08:02,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:02,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 02:08:02,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:08:02,850 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 02:08:07,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:07,096 INFO L93 Difference]: Finished difference Result 1518 states and 1772 transitions. [2024-11-28 02:08:07,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:08:07,097 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 02:08:07,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:07,101 INFO L225 Difference]: With dead ends: 1518 [2024-11-28 02:08:07,101 INFO L226 Difference]: Without dead ends: 1518 [2024-11-28 02:08:07,102 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 02:08:07,104 INFO L435 NwaCegarLoop]: 1045 mSDtfsCounter, 1565 mSDsluCounter, 10228 mSDsCounter, 0 mSdLazyCounter, 6584 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 11273 SdHoareTripleChecker+Invalid, 6609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 6584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:07,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 11273 Invalid, 6609 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 6584 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-28 02:08:07,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-11-28 02:08:07,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1514. [2024-11-28 02:08:07,123 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 02:08:07,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1764 transitions. [2024-11-28 02:08:07,126 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1764 transitions. Word has length 92 [2024-11-28 02:08:07,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:07,127 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 1764 transitions. [2024-11-28 02:08:07,127 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 02:08:07,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1764 transitions. [2024-11-28 02:08:07,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-28 02:08:07,128 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:07,128 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 02:08:07,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 02:08:07,129 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 02:08:07,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:07,130 INFO L85 PathProgramCache]: Analyzing trace with hash 497879811, now seen corresponding path program 1 times [2024-11-28 02:08:07,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:07,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222523123] [2024-11-28 02:08:07,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:07,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:08,319 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 02:08:08,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:08,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222523123] [2024-11-28 02:08:08,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222523123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:08:08,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:08:08,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 02:08:08,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292022449] [2024-11-28 02:08:08,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:08:08,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 02:08:08,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:08,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 02:08:08,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-28 02:08:08,322 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 02:08:12,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:12,871 INFO L93 Difference]: Finished difference Result 1517 states and 1771 transitions. [2024-11-28 02:08:12,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 02:08:12,871 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 02:08:12,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:12,874 INFO L225 Difference]: With dead ends: 1517 [2024-11-28 02:08:12,874 INFO L226 Difference]: Without dead ends: 1517 [2024-11-28 02:08:12,875 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 02:08:12,875 INFO L435 NwaCegarLoop]: 1052 mSDtfsCounter, 1563 mSDsluCounter, 7053 mSDsCounter, 0 mSdLazyCounter, 6441 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s 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.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:12,875 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.3s Time] [2024-11-28 02:08:12,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-11-28 02:08:12,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1514. [2024-11-28 02:08:12,891 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 02:08:12,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1763 transitions. [2024-11-28 02:08:12,894 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1763 transitions. Word has length 92 [2024-11-28 02:08:12,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:12,894 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 1763 transitions. [2024-11-28 02:08:12,894 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 02:08:12,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1763 transitions. [2024-11-28 02:08:12,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-28 02:08:12,895 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:12,895 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 02:08:12,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 02:08:12,896 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 02:08:12,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:12,896 INFO L85 PathProgramCache]: Analyzing trace with hash 891975286, now seen corresponding path program 1 times [2024-11-28 02:08:12,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:12,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424547873] [2024-11-28 02:08:12,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:12,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:13,663 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 02:08:13,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:13,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424547873] [2024-11-28 02:08:13,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424547873] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:08:13,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402586616] [2024-11-28 02:08:13,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:13,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:08:13,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:08:13,668 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:08:13,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 02:08:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:14,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-28 02:08:14,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:08:14,074 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 02:08:14,215 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:08:14,215 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 02:08:14,225 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 02:08:14,284 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:08:14,285 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 02:08:14,334 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:08:14,334 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 02:08:14,389 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:08:14,390 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 02:08:14,408 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 02:08:14,412 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 02:08:14,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:08:14,440 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-28 02:08:14,440 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 02:08:14,493 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 02:08:14,511 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 02:08:14,520 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 02:08:14,561 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 02:08:14,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402586616] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:08:14,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:08:14,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2024-11-28 02:08:14,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896652633] [2024-11-28 02:08:14,563 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:08:14,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:08:14,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:14,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:08:14,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=231, Unknown=8, NotChecked=132, Total=420 [2024-11-28 02:08:14,566 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 02:08:17,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:17,961 INFO L93 Difference]: Finished difference Result 1516 states and 1770 transitions. [2024-11-28 02:08:17,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:08:17,962 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 02:08:17,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:17,965 INFO L225 Difference]: With dead ends: 1516 [2024-11-28 02:08:17,965 INFO L226 Difference]: Without dead ends: 1516 [2024-11-28 02:08:17,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=464, Unknown=8, NotChecked=188, Total=756 [2024-11-28 02:08:17,966 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 02:08:17,966 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 02:08:17,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-11-28 02:08:18,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1513. [2024-11-28 02:08:18,005 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 02:08:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1762 transitions. [2024-11-28 02:08:18,007 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1762 transitions. Word has length 93 [2024-11-28 02:08:18,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:18,007 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1762 transitions. [2024-11-28 02:08:18,007 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 02:08:18,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1762 transitions. [2024-11-28 02:08:18,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-28 02:08:18,008 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:18,008 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 02:08:18,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 02:08:18,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:08:18,209 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 02:08:18,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:18,210 INFO L85 PathProgramCache]: Analyzing trace with hash 891975287, now seen corresponding path program 1 times [2024-11-28 02:08:18,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:18,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610255777] [2024-11-28 02:08:18,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:18,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:19,377 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 02:08:19,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:19,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610255777] [2024-11-28 02:08:19,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610255777] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:08:19,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222658566] [2024-11-28 02:08:19,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:19,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:08:19,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:08:19,380 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:08:19,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 02:08:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:19,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-28 02:08:19,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:08:19,792 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 02:08:19,941 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:08:19,941 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 02:08:19,953 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 02:08:19,968 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 02:08:19,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:08:20,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 02:08:20,050 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 02:08:20,203 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:08:20,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 62 treesize of output 57 [2024-11-28 02:08:20,213 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 02:08:20,326 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:08:20,327 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 02:08:20,334 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 02:08:20,429 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:08:20,429 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 02:08:20,435 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 02:08:20,465 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 02:08:20,474 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 02:08:20,475 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 02:08:20,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:08:20,568 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 02:08:20,583 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 02:08:20,612 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 02:08:20,634 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 02:08:20,717 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 02:08:20,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222658566] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:08:20,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:08:20,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 17 [2024-11-28 02:08:20,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776619253] [2024-11-28 02:08:20,722 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:08:20,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 02:08:20,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:20,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 02:08:20,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=321, Unknown=5, NotChecked=200, Total=600 [2024-11-28 02:08:20,723 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 02:08:27,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:27,982 INFO L93 Difference]: Finished difference Result 1515 states and 1769 transitions. [2024-11-28 02:08:27,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:08:27,983 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 02:08:27,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:27,987 INFO L225 Difference]: With dead ends: 1515 [2024-11-28 02:08:27,987 INFO L226 Difference]: Without dead ends: 1515 [2024-11-28 02:08:27,987 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 02:08:27,988 INFO L435 NwaCegarLoop]: 1050 mSDtfsCounter, 1533 mSDsluCounter, 10469 mSDsCounter, 0 mSdLazyCounter, 9486 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s 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.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:27,988 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.0s Time] [2024-11-28 02:08:27,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-28 02:08:28,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1500. [2024-11-28 02:08:28,006 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 02:08:28,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1748 transitions. [2024-11-28 02:08:28,009 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1748 transitions. Word has length 93 [2024-11-28 02:08:28,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:28,010 INFO L471 AbstractCegarLoop]: Abstraction has 1500 states and 1748 transitions. [2024-11-28 02:08:28,010 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 02:08:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1748 transitions. [2024-11-28 02:08:28,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-28 02:08:28,011 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:28,011 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 02:08:28,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 02:08:28,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-28 02:08:28,216 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 02:08:28,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:28,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1815990121, now seen corresponding path program 1 times [2024-11-28 02:08:28,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:28,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881806685] [2024-11-28 02:08:28,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:28,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:28,988 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 02:08:28,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:28,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881806685] [2024-11-28 02:08:28,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881806685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:08:28,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:08:28,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 02:08:28,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454770485] [2024-11-28 02:08:28,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:08:28,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:08:28,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:28,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:08:28,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-28 02:08:28,991 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 02:08:33,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:33,502 INFO L93 Difference]: Finished difference Result 1519 states and 1773 transitions. [2024-11-28 02:08:33,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:08:33,502 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 02:08:33,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:33,507 INFO L225 Difference]: With dead ends: 1519 [2024-11-28 02:08:33,507 INFO L226 Difference]: Without dead ends: 1519 [2024-11-28 02:08:33,507 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 02:08:33,508 INFO L435 NwaCegarLoop]: 1044 mSDtfsCounter, 1566 mSDsluCounter, 11198 mSDsCounter, 0 mSdLazyCounter, 7173 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s 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.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:33,508 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.2s Time] [2024-11-28 02:08:33,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2024-11-28 02:08:33,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1515. [2024-11-28 02:08:33,528 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 02:08:33,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1765 transitions. [2024-11-28 02:08:33,531 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1765 transitions. Word has length 95 [2024-11-28 02:08:33,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:33,532 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 1765 transitions. [2024-11-28 02:08:33,532 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 02:08:33,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1765 transitions. [2024-11-28 02:08:33,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-28 02:08:33,533 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:33,533 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 02:08:33,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 02:08:33,534 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 02:08:33,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:33,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1815990122, now seen corresponding path program 1 times [2024-11-28 02:08:33,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:33,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473913065] [2024-11-28 02:08:33,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:33,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:34,533 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 02:08:34,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:34,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473913065] [2024-11-28 02:08:34,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473913065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:08:34,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:08:34,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 02:08:34,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902334962] [2024-11-28 02:08:34,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:08:34,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 02:08:34,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:34,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 02:08:34,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-28 02:08:34,535 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 02:08:38,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:38,536 INFO L93 Difference]: Finished difference Result 1518 states and 1772 transitions. [2024-11-28 02:08:38,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 02:08:38,537 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 02:08:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:38,542 INFO L225 Difference]: With dead ends: 1518 [2024-11-28 02:08:38,542 INFO L226 Difference]: Without dead ends: 1518 [2024-11-28 02:08:38,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-28 02:08:38,543 INFO L435 NwaCegarLoop]: 1051 mSDtfsCounter, 1565 mSDsluCounter, 5265 mSDsCounter, 0 mSdLazyCounter, 5053 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:38,543 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.8s Time] [2024-11-28 02:08:38,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-11-28 02:08:38,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1515. [2024-11-28 02:08:38,569 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 02:08:38,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1764 transitions. [2024-11-28 02:08:38,573 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1764 transitions. Word has length 95 [2024-11-28 02:08:38,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:38,574 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 1764 transitions. [2024-11-28 02:08:38,574 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 02:08:38,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1764 transitions. [2024-11-28 02:08:38,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 02:08:38,575 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:38,576 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 02:08:38,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 02:08:38,576 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 02:08:38,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:38,577 INFO L85 PathProgramCache]: Analyzing trace with hash -126271627, now seen corresponding path program 1 times [2024-11-28 02:08:38,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:38,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062592276] [2024-11-28 02:08:38,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:38,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:39,563 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 02:08:39,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:39,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062592276] [2024-11-28 02:08:39,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062592276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:08:39,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050972923] [2024-11-28 02:08:39,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:39,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:08:39,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:08:39,569 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:08:39,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 02:08:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:39,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-28 02:08:39,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:08:39,969 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 02:08:40,096 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:08:40,097 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 02:08:40,103 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 02:08:40,188 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:08:40,188 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 02:08:40,237 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:08:40,238 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 02:08:40,287 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:08:40,287 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 02:08:40,343 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:08:40,343 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 02:08:40,358 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 02:08:40,361 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 02:08:40,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:08:40,371 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 02:08:40,377 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 02:08:40,469 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 02:08:40,586 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-28 02:08:40,586 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 02:08:40,597 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 02:08:40,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050972923] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:08:40,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:08:40,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 20 [2024-11-28 02:08:40,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766060734] [2024-11-28 02:08:40,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:08:40,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 02:08:40,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:40,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 02:08:40,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=445, Unknown=31, NotChecked=188, Total=756 [2024-11-28 02:08:40,602 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 02:08:46,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:46,103 INFO L93 Difference]: Finished difference Result 1517 states and 1771 transitions. [2024-11-28 02:08:46,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 02:08:46,103 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 02:08:46,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:46,107 INFO L225 Difference]: With dead ends: 1517 [2024-11-28 02:08:46,107 INFO L226 Difference]: Without dead ends: 1517 [2024-11-28 02:08:46,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=859, Unknown=38, NotChecked=260, Total=1332 [2024-11-28 02:08:46,109 INFO L435 NwaCegarLoop]: 1044 mSDtfsCounter, 1531 mSDsluCounter, 14258 mSDsCounter, 0 mSdLazyCounter, 8909 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s 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.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:46,112 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.2s Time] [2024-11-28 02:08:46,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-11-28 02:08:46,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1514. [2024-11-28 02:08:46,136 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 02:08:46,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1763 transitions. [2024-11-28 02:08:46,139 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1763 transitions. Word has length 96 [2024-11-28 02:08:46,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:46,139 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 1763 transitions. [2024-11-28 02:08:46,139 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 02:08:46,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1763 transitions. [2024-11-28 02:08:46,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 02:08:46,140 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:46,141 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 02:08:46,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 02:08:46,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-28 02:08:46,342 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 02:08:46,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:46,343 INFO L85 PathProgramCache]: Analyzing trace with hash -126271626, now seen corresponding path program 1 times [2024-11-28 02:08:46,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:46,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738792967] [2024-11-28 02:08:46,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:46,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:47,361 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 02:08:47,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:47,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738792967] [2024-11-28 02:08:47,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738792967] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:08:47,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823308879] [2024-11-28 02:08:47,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:47,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:08:47,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:08:47,365 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:08:47,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 02:08:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:47,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-28 02:08:47,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:08:47,776 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 02:08:47,895 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:08:47,895 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 02:08:47,902 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 02:08:47,931 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 02:08:47,937 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 02:08:48,023 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 02:08:48,030 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 02:08:48,158 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:08:48,158 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 02:08:48,168 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 02:08:48,286 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:08:48,286 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 02:08:48,294 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 02:08:48,366 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:08:48,366 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 02:08:48,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 02:08:48,452 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:08:48,453 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 02:08:48,458 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 02:08:48,483 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 02:08:48,490 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 02:08:48,515 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 02:08:48,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:08:48,592 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 02:08:48,664 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 02:08:48,677 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 02:08:48,707 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 02:08:48,978 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 02:08:48,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823308879] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:08:48,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:08:48,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-11-28 02:08:48,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503128757] [2024-11-28 02:08:48,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:08:48,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 02:08:48,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:48,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 02:08:48,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=635, Unknown=21, NotChecked=280, Total=1056 [2024-11-28 02:08:48,985 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 02:08:56,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:56,139 INFO L93 Difference]: Finished difference Result 1516 states and 1770 transitions. [2024-11-28 02:08:56,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:08:56,139 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 02:08:56,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:56,141 INFO L225 Difference]: With dead ends: 1516 [2024-11-28 02:08:56,141 INFO L226 Difference]: Without dead ends: 1516 [2024-11-28 02:08:56,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=195, Invalid=994, Unknown=21, NotChecked=350, Total=1560 [2024-11-28 02:08:56,142 INFO L435 NwaCegarLoop]: 1049 mSDtfsCounter, 1533 mSDsluCounter, 9493 mSDsCounter, 0 mSdLazyCounter, 8909 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s 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, 6.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:56,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 10542 Invalid, 8936 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 8909 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-11-28 02:08:56,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-11-28 02:08:56,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1498. [2024-11-28 02:08:56,155 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 02:08:56,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1746 transitions. [2024-11-28 02:08:56,157 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 1746 transitions. Word has length 96 [2024-11-28 02:08:56,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:56,157 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 1746 transitions. [2024-11-28 02:08:56,157 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 02:08:56,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1746 transitions. [2024-11-28 02:08:56,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-28 02:08:56,157 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:56,158 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 02:08:56,170 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 02:08:56,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-28 02:08:56,358 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 02:08:56,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:56,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1907991275, now seen corresponding path program 1 times [2024-11-28 02:08:56,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:56,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44817452] [2024-11-28 02:08:56,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:56,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:57,306 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 02:08:57,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:57,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44817452] [2024-11-28 02:08:57,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44817452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:08:57,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:08:57,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 02:08:57,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257841692] [2024-11-28 02:08:57,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:08:57,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 02:08:57,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:57,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 02:08:57,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-28 02:08:57,309 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 02:09:00,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:00,030 INFO L93 Difference]: Finished difference Result 1521 states and 1775 transitions. [2024-11-28 02:09:00,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:09:00,030 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 02:09:00,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:00,035 INFO L225 Difference]: With dead ends: 1521 [2024-11-28 02:09:00,036 INFO L226 Difference]: Without dead ends: 1521 [2024-11-28 02:09:00,036 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 02:09:00,037 INFO L435 NwaCegarLoop]: 1049 mSDtfsCounter, 1569 mSDsluCounter, 6095 mSDsCounter, 0 mSdLazyCounter, 4200 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:00,037 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.5s Time] [2024-11-28 02:09:00,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2024-11-28 02:09:00,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1517. [2024-11-28 02:09:00,056 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 02:09:00,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1767 transitions. [2024-11-28 02:09:00,059 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 1767 transitions. Word has length 99 [2024-11-28 02:09:00,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:00,059 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 1767 transitions. [2024-11-28 02:09:00,059 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 02:09:00,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1767 transitions. [2024-11-28 02:09:00,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-28 02:09:00,060 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:00,061 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 02:09:00,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-28 02:09:00,061 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 02:09:00,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:00,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1907991276, now seen corresponding path program 1 times [2024-11-28 02:09:00,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:00,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081311206] [2024-11-28 02:09:00,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:00,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:01,611 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 02:09:01,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:01,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081311206] [2024-11-28 02:09:01,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081311206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:01,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:01,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 02:09:01,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673345995] [2024-11-28 02:09:01,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:01,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 02:09:01,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:01,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 02:09:01,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:09:01,613 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 02:09:07,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:07,077 INFO L93 Difference]: Finished difference Result 1520 states and 1774 transitions. [2024-11-28 02:09:07,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:09:07,077 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 02:09:07,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:07,080 INFO L225 Difference]: With dead ends: 1520 [2024-11-28 02:09:07,080 INFO L226 Difference]: Without dead ends: 1520 [2024-11-28 02:09:07,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2024-11-28 02:09:07,081 INFO L435 NwaCegarLoop]: 1050 mSDtfsCounter, 1548 mSDsluCounter, 8667 mSDsCounter, 0 mSdLazyCounter, 8079 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1563 SdHoareTripleChecker+Valid, 9717 SdHoareTripleChecker+Invalid, 8104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 8079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:07,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1563 Valid, 9717 Invalid, 8104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 8079 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-28 02:09:07,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2024-11-28 02:09:07,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1517. [2024-11-28 02:09:07,096 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 02:09:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1766 transitions. [2024-11-28 02:09:07,099 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 1766 transitions. Word has length 99 [2024-11-28 02:09:07,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:07,099 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 1766 transitions. [2024-11-28 02:09:07,100 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 02:09:07,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1766 transitions. [2024-11-28 02:09:07,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-28 02:09:07,101 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:07,101 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 02:09:07,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-28 02:09:07,101 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 02:09:07,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:07,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1822020361, now seen corresponding path program 1 times [2024-11-28 02:09:07,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:07,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734783655] [2024-11-28 02:09:07,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:07,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:08,106 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 02:09:08,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:08,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734783655] [2024-11-28 02:09:08,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734783655] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:09:08,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11880582] [2024-11-28 02:09:08,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:08,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:09:08,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:09:08,109 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:09:08,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 02:09:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:08,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-28 02:09:08,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:09:08,508 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 02:09:08,611 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:09:08,611 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 02:09:08,618 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 02:09:08,751 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:08,751 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 02:09:08,813 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:08,814 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 02:09:08,871 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:08,871 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 02:09:08,929 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:08,930 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 02:09:08,998 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:08,998 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 02:09:09,014 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 02:09:09,043 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 02:09:09,044 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 02:09:09,047 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 02:09:09,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:09:09,951 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-28 02:09:09,953 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 02:09:09,990 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 02:09:09,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11880582] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:09:09,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:09:09,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 23 [2024-11-28 02:09:09,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930103029] [2024-11-28 02:09:09,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:09:09,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 02:09:09,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:09,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 02:09:09,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=929, Unknown=48, NotChecked=64, Total=1190 [2024-11-28 02:09:09,996 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 02:09:16,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:16,073 INFO L93 Difference]: Finished difference Result 1519 states and 1773 transitions. [2024-11-28 02:09:16,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 02:09:16,074 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 02:09:16,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:16,077 INFO L225 Difference]: With dead ends: 1519 [2024-11-28 02:09:16,077 INFO L226 Difference]: Without dead ends: 1519 [2024-11-28 02:09:16,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=271, Invalid=1577, Unknown=48, NotChecked=84, Total=1980 [2024-11-28 02:09:16,078 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 1533 mSDsluCounter, 14288 mSDsCounter, 0 mSdLazyCounter, 8956 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s 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.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:16,078 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.7s Time] [2024-11-28 02:09:16,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2024-11-28 02:09:16,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1516. [2024-11-28 02:09:16,103 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 02:09:16,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 1765 transitions. [2024-11-28 02:09:16,106 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 1765 transitions. Word has length 100 [2024-11-28 02:09:16,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:16,108 INFO L471 AbstractCegarLoop]: Abstraction has 1516 states and 1765 transitions. [2024-11-28 02:09:16,108 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 02:09:16,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 1765 transitions. [2024-11-28 02:09:16,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-28 02:09:16,110 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:16,110 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 02:09:16,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 02:09:16,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:09:16,311 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 02:09:16,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:16,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1822020360, now seen corresponding path program 1 times [2024-11-28 02:09:16,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:16,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582395861] [2024-11-28 02:09:16,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:16,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:17,812 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 02:09:17,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:17,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582395861] [2024-11-28 02:09:17,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582395861] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:09:17,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022413228] [2024-11-28 02:09:17,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:17,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:09:17,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:09:17,815 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:09:17,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 02:09:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:18,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-28 02:09:18,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:09:18,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 02:09:18,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 02:09:18,357 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:09:18,357 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 02:09:18,368 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 02:09:18,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 02:09:18,437 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 02:09:18,442 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 02:09:18,670 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:18,670 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 02:09:18,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 02:09:18,802 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:18,802 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 02:09:18,809 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 02:09:18,889 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:18,889 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 02:09:18,894 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 02:09:18,991 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:18,991 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 02:09:18,997 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 02:09:19,083 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:19,083 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 02:09:19,092 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 02:09:19,110 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 02:09:19,120 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 02:09:19,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:09:19,130 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 02:09:19,137 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:09:19,138 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 02:09:19,141 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 02:09:19,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:09:20,048 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 02:09:21,356 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 02:09:21,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:09:21,536 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 02:09:22,152 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 02:09:22,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022413228] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:09:22,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:09:22,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 25 [2024-11-28 02:09:22,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822445596] [2024-11-28 02:09:22,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:09:22,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 02:09:22,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:22,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 02:09:22,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1007, Unknown=38, NotChecked=204, Total=1406 [2024-11-28 02:09:22,164 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 02:09:37,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:37,610 INFO L93 Difference]: Finished difference Result 1518 states and 1772 transitions. [2024-11-28 02:09:37,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 02:09:37,610 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 02:09:37,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:37,613 INFO L225 Difference]: With dead ends: 1518 [2024-11-28 02:09:37,613 INFO L226 Difference]: Without dead ends: 1518 [2024-11-28 02:09:37,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=271, Invalid=1683, Unknown=38, NotChecked=264, Total=2256 [2024-11-28 02:09:37,614 INFO L435 NwaCegarLoop]: 1042 mSDtfsCounter, 1528 mSDsluCounter, 11227 mSDsCounter, 0 mSdLazyCounter, 10366 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s 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, 14.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:37,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1543 Valid, 12269 Invalid, 10396 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 10366 Invalid, 0 Unknown, 0 Unchecked, 14.6s Time] [2024-11-28 02:09:37,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-11-28 02:09:37,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1496. [2024-11-28 02:09:37,632 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 02:09:37,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1744 transitions. [2024-11-28 02:09:37,635 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 1744 transitions. Word has length 100 [2024-11-28 02:09:37,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:37,636 INFO L471 AbstractCegarLoop]: Abstraction has 1496 states and 1744 transitions. [2024-11-28 02:09:37,636 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 02:09:37,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1744 transitions. [2024-11-28 02:09:37,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-28 02:09:37,637 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:37,637 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 02:09:37,650 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 02:09:37,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-28 02:09:37,838 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 02:09:37,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:37,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1371536655, now seen corresponding path program 1 times [2024-11-28 02:09:37,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:37,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594016956] [2024-11-28 02:09:37,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:37,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:38,709 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 02:09:38,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:38,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594016956] [2024-11-28 02:09:38,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594016956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:38,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:38,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 02:09:38,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19531340] [2024-11-28 02:09:38,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:38,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 02:09:38,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:38,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 02:09:38,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:09:38,711 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 02:09:47,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:47,757 INFO L93 Difference]: Finished difference Result 1522 states and 1776 transitions. [2024-11-28 02:09:47,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:09:47,758 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 02:09:47,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:47,759 INFO L225 Difference]: With dead ends: 1522 [2024-11-28 02:09:47,760 INFO L226 Difference]: Without dead ends: 1522 [2024-11-28 02:09:47,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2024-11-28 02:09:47,760 INFO L435 NwaCegarLoop]: 1048 mSDtfsCounter, 1551 mSDsluCounter, 11243 mSDsCounter, 0 mSdLazyCounter, 7106 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.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, 8.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:47,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1566 Valid, 12291 Invalid, 7131 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 7106 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2024-11-28 02:09:47,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2024-11-28 02:09:47,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1518. [2024-11-28 02:09:47,773 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 02:09:47,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1768 transitions. [2024-11-28 02:09:47,777 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1768 transitions. Word has length 102 [2024-11-28 02:09:47,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:47,777 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 1768 transitions. [2024-11-28 02:09:47,778 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 02:09:47,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1768 transitions. [2024-11-28 02:09:47,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-28 02:09:47,779 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:47,779 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 02:09:47,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-28 02:09:47,779 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 02:09:47,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:47,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1371536656, now seen corresponding path program 1 times [2024-11-28 02:09:47,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:47,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406813081] [2024-11-28 02:09:47,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:47,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:49,973 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 02:09:49,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:49,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406813081] [2024-11-28 02:09:49,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406813081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:49,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:49,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 02:09:49,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630014508] [2024-11-28 02:09:49,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:49,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 02:09:49,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:49,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 02:09:49,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-28 02:09:49,975 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 02:09:57,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:57,750 INFO L93 Difference]: Finished difference Result 1521 states and 1775 transitions. [2024-11-28 02:09:57,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 02:09:57,750 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 02:09:57,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:57,752 INFO L225 Difference]: With dead ends: 1521 [2024-11-28 02:09:57,753 INFO L226 Difference]: Without dead ends: 1521 [2024-11-28 02:09:57,753 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 02:09:57,753 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 1550 mSDsluCounter, 6486 mSDsCounter, 0 mSdLazyCounter, 5503 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s 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, 7.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:57,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1565 Valid, 7529 Invalid, 5531 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 5503 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-28 02:09:57,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2024-11-28 02:09:57,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1518. [2024-11-28 02:09:57,775 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 02:09:57,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1767 transitions. [2024-11-28 02:09:57,779 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1767 transitions. Word has length 102 [2024-11-28 02:09:57,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:57,780 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 1767 transitions. [2024-11-28 02:09:57,780 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 02:09:57,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1767 transitions. [2024-11-28 02:09:57,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-28 02:09:57,781 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:57,781 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 02:09:57,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-28 02:09:57,782 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 02:09:57,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:57,782 INFO L85 PathProgramCache]: Analyzing trace with hash -11229309, now seen corresponding path program 1 times [2024-11-28 02:09:57,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:57,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317455437] [2024-11-28 02:09:57,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:57,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:58,592 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 02:09:58,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:58,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317455437] [2024-11-28 02:09:58,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317455437] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:09:58,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086740490] [2024-11-28 02:09:58,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:58,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:09:58,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:09:58,595 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:09:58,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 02:09:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:58,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-28 02:09:58,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:09:58,986 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 02:09:59,173 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:09:59,173 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 02:09:59,181 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 02:09:59,251 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:59,251 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 02:09:59,316 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:59,316 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 02:09:59,398 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:59,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 02:09:59,475 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:59,475 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 02:09:59,558 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:59,558 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 02:09:59,630 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:09:59,630 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 02:09:59,692 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 02:09:59,696 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 02:09:59,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:09:59,722 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-28 02:09:59,722 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 02:09:59,729 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 02:09:59,746 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 02:09:59,765 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 02:10:00,138 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 02:10:00,157 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 02:10:00,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086740490] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:10:00,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:10:00,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 21 [2024-11-28 02:10:00,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497680841] [2024-11-28 02:10:00,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:10:00,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 02:10:00,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:10:00,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 02:10:00,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=610, Unknown=43, NotChecked=280, Total=1056 [2024-11-28 02:10:00,683 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 02:10:08,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:10:08,370 INFO L93 Difference]: Finished difference Result 1520 states and 1774 transitions. [2024-11-28 02:10:08,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 02:10:08,371 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 02:10:08,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:10:08,373 INFO L225 Difference]: With dead ends: 1520 [2024-11-28 02:10:08,373 INFO L226 Difference]: Without dead ends: 1520 [2024-11-28 02:10:08,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=229, Invalid=1154, Unknown=43, NotChecked=380, Total=1806 [2024-11-28 02:10:08,373 INFO L435 NwaCegarLoop]: 1048 mSDtfsCounter, 1551 mSDsluCounter, 9244 mSDsCounter, 0 mSdLazyCounter, 5965 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s 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, 7.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:10:08,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1566 Valid, 10292 Invalid, 6012 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [47 Valid, 5965 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-28 02:10:08,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2024-11-28 02:10:08,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1517. [2024-11-28 02:10:08,390 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 02:10:08,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1766 transitions. [2024-11-28 02:10:08,393 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 1766 transitions. Word has length 103 [2024-11-28 02:10:08,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:10:08,394 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 1766 transitions. [2024-11-28 02:10:08,394 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 02:10:08,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1766 transitions. [2024-11-28 02:10:08,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-28 02:10:08,395 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:10:08,395 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 02:10:08,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 02:10:08,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-28 02:10:08,596 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 02:10:08,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:10:08,598 INFO L85 PathProgramCache]: Analyzing trace with hash -11229308, now seen corresponding path program 1 times [2024-11-28 02:10:08,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:10:08,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004505707] [2024-11-28 02:10:08,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:08,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:10:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:11,006 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 02:10:11,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:10:11,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004505707] [2024-11-28 02:10:11,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004505707] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:10:11,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962715111] [2024-11-28 02:10:11,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:11,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:10:11,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:10:11,010 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:10:11,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 02:10:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:11,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-28 02:10:11,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:10:11,475 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 02:10:11,701 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 02:10:11,721 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:10:11,722 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 02:10:11,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:10:11,800 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 02:10:11,966 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 02:10:11,973 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 02:10:12,370 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:12,370 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 02:10:12,389 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 02:10:12,706 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:12,706 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 02:10:12,715 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 02:10:12,961 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:12,961 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 02:10:12,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:10:13,166 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:13,167 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 02:10:13,175 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 02:10:13,376 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:13,376 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 02:10:13,385 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 02:10:13,575 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-28 02:10:13,575 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 02:10:13,603 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-28 02:10:13,604 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 02:10:13,739 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:10:13,739 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 02:10:13,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 16 [2024-11-28 02:10:13,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2024-11-28 02:10:13,940 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 02:10:13,950 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 02:10:13,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:10:15,470 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 02:10:16,711 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 02:10:16,836 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 02:10:17,679 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 02:10:17,679 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 02:10:17,740 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 02:10:17,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962715111] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:10:17,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:10:17,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 33 [2024-11-28 02:10:17,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829598531] [2024-11-28 02:10:17,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:10:17,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-28 02:10:17,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:10:17,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-28 02:10:17,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1661, Unknown=27, NotChecked=348, Total=2256 [2024-11-28 02:10:17,747 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 02:10:41,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:10:41,546 INFO L93 Difference]: Finished difference Result 1519 states and 1773 transitions. [2024-11-28 02:10:41,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 02:10:41,546 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 02:10:41,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:10:41,549 INFO L225 Difference]: With dead ends: 1519 [2024-11-28 02:10:41,549 INFO L226 Difference]: Without dead ends: 1519 [2024-11-28 02:10:41,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=412, Invalid=2769, Unknown=27, NotChecked=452, Total=3660 [2024-11-28 02:10:41,551 INFO L435 NwaCegarLoop]: 1041 mSDtfsCounter, 1531 mSDsluCounter, 15447 mSDsCounter, 0 mSdLazyCounter, 14255 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 16488 SdHoareTripleChecker+Invalid, 14286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 14255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:10:41,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 16488 Invalid, 14286 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [31 Valid, 14255 Invalid, 0 Unknown, 0 Unchecked, 22.3s Time] [2024-11-28 02:10:41,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2024-11-28 02:10:41,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1494. [2024-11-28 02:10:41,564 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 02:10:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1742 transitions. [2024-11-28 02:10:41,565 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1742 transitions. Word has length 103 [2024-11-28 02:10:41,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:10:41,566 INFO L471 AbstractCegarLoop]: Abstraction has 1494 states and 1742 transitions. [2024-11-28 02:10:41,566 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 02:10:41,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1742 transitions. [2024-11-28 02:10:41,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-28 02:10:41,566 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:10:41,567 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 02:10:41,578 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 02:10:41,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-28 02:10:41,767 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 02:10:41,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:10:41,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1425267602, now seen corresponding path program 1 times [2024-11-28 02:10:41,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:10:41,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836601971] [2024-11-28 02:10:41,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:41,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:10:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:42,995 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 02:10:42,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:10:42,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836601971] [2024-11-28 02:10:42,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836601971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:10:42,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:10:42,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-28 02:10:42,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283760965] [2024-11-28 02:10:42,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:10:42,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 02:10:42,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:10:42,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 02:10:42,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-28 02:10:42,997 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 02:10:52,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:10:52,976 INFO L93 Difference]: Finished difference Result 1545 states and 1801 transitions. [2024-11-28 02:10:52,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:10:52,976 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 02:10:52,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:10:52,978 INFO L225 Difference]: With dead ends: 1545 [2024-11-28 02:10:52,978 INFO L226 Difference]: Without dead ends: 1545 [2024-11-28 02:10:52,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2024-11-28 02:10:52,979 INFO L435 NwaCegarLoop]: 1046 mSDtfsCounter, 1593 mSDsluCounter, 12260 mSDsCounter, 0 mSdLazyCounter, 7762 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s 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, 9.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:10:52,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 13306 Invalid, 7791 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 7762 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2024-11-28 02:10:52,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-11-28 02:10:52,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1519. [2024-11-28 02:10:52,995 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 02:10:53,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 1769 transitions. [2024-11-28 02:10:53,001 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 1769 transitions. Word has length 105 [2024-11-28 02:10:53,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:10:53,001 INFO L471 AbstractCegarLoop]: Abstraction has 1519 states and 1769 transitions. [2024-11-28 02:10:53,001 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 02:10:53,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1769 transitions. [2024-11-28 02:10:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-28 02:10:53,002 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:10:53,002 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 02:10:53,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-28 02:10:53,002 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 02:10:53,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:10:53,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1425267603, now seen corresponding path program 1 times [2024-11-28 02:10:53,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:10:53,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560741176] [2024-11-28 02:10:53,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:53,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:10:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:54,579 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 02:10:54,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:10:54,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560741176] [2024-11-28 02:10:54,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560741176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:10:54,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:10:54,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 02:10:54,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189920212] [2024-11-28 02:10:54,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:10:54,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:10:54,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:10:54,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:10:54,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-28 02:10:54,581 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 02:11:04,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:11:04,567 INFO L93 Difference]: Finished difference Result 1544 states and 1800 transitions. [2024-11-28 02:11:04,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:11:04,567 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 02:11:04,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:11:04,569 INFO L225 Difference]: With dead ends: 1544 [2024-11-28 02:11:04,569 INFO L226 Difference]: Without dead ends: 1544 [2024-11-28 02:11:04,570 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 02:11:04,570 INFO L435 NwaCegarLoop]: 1042 mSDtfsCounter, 1612 mSDsluCounter, 9783 mSDsCounter, 0 mSdLazyCounter, 7053 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s 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, 9.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:11:04,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1627 Valid, 10825 Invalid, 7083 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 7053 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2024-11-28 02:11:04,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2024-11-28 02:11:04,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1519. [2024-11-28 02:11:04,590 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 02:11:04,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 1768 transitions. [2024-11-28 02:11:04,593 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 1768 transitions. Word has length 105 [2024-11-28 02:11:04,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:11:04,594 INFO L471 AbstractCegarLoop]: Abstraction has 1519 states and 1768 transitions. [2024-11-28 02:11:04,594 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 02:11:04,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1768 transitions. [2024-11-28 02:11:04,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-28 02:11:04,595 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:11:04,595 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 02:11:04,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-28 02:11:04,595 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 02:11:04,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:11:04,596 INFO L85 PathProgramCache]: Analyzing trace with hash 475770014, now seen corresponding path program 1 times [2024-11-28 02:11:04,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:11:04,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27323960] [2024-11-28 02:11:04,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:11:04,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:11:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:11:07,659 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 02:11:07,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:11:07,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27323960] [2024-11-28 02:11:07,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27323960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:11:07,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:11:07,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 02:11:07,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75937908] [2024-11-28 02:11:07,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:11:07,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 02:11:07,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:11:07,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 02:11:07,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:11:07,661 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 02:11:17,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:11:17,623 INFO L93 Difference]: Finished difference Result 1518 states and 1767 transitions. [2024-11-28 02:11:17,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:11:17,624 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 02:11:17,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:11:17,626 INFO L225 Difference]: With dead ends: 1518 [2024-11-28 02:11:17,626 INFO L226 Difference]: Without dead ends: 1518 [2024-11-28 02:11:17,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2024-11-28 02:11:17,626 INFO L435 NwaCegarLoop]: 1054 mSDtfsCounter, 4625 mSDsluCounter, 10227 mSDsCounter, 0 mSdLazyCounter, 6447 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s 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, 9.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:11:17,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4634 Valid, 11281 Invalid, 6492 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [45 Valid, 6447 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2024-11-28 02:11:17,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-11-28 02:11:17,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1518. [2024-11-28 02:11:17,637 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 02:11:17,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1767 transitions. [2024-11-28 02:11:17,640 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1767 transitions. Word has length 106 [2024-11-28 02:11:17,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:11:17,640 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 1767 transitions. [2024-11-28 02:11:17,640 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 02:11:17,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1767 transitions. [2024-11-28 02:11:17,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-28 02:11:17,641 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:11:17,642 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 02:11:17,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-28 02:11:17,642 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 02:11:17,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:11:17,642 INFO L85 PathProgramCache]: Analyzing trace with hash 475770015, now seen corresponding path program 1 times [2024-11-28 02:11:17,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:11:17,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190567867] [2024-11-28 02:11:17,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:11:17,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:11:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:11:19,653 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 02:11:19,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:11:19,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190567867] [2024-11-28 02:11:19,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190567867] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:11:19,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467909854] [2024-11-28 02:11:19,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:11:19,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:11:19,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:11:19,655 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:11:19,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 02:11:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:11:20,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-28 02:11:20,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:11:20,166 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 02:11:20,376 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:11:20,376 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 02:11:20,388 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 02:11:20,395 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 02:11:20,567 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:11:20,567 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 02:11:20,572 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 02:11:20,676 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:11:20,677 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 02:11:20,684 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 02:11:20,824 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:11:20,824 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 02:11:20,831 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 02:11:20,930 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:11:20,930 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 02:11:20,935 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 02:11:21,033 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:11:21,033 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 02:11:21,039 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 02:11:21,173 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:11:21,173 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 02:11:21,179 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 02:11:21,377 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:11:21,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 62 treesize of output 57 [2024-11-28 02:11:21,389 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 02:11:21,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 02:11:21,425 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 02:11:21,435 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 02:11:21,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:11:21,577 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 02:11:21,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:11:21,760 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 02:11:22,114 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 02:11:22,162 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 02:11:22,195 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 02:11:22,246 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 02:11:22,290 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 02:11:23,418 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 02:11:27,635 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 02:11:32,132 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 02:11:36,405 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 02:11:41,177 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 02:11:41,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467909854] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:11:41,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:11:41,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 25 [2024-11-28 02:11:41,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261352257] [2024-11-28 02:11:41,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:11:41,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 02:11:41,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:11:41,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 02:11:41,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=756, Unknown=44, NotChecked=726, Total=1640 [2024-11-28 02:11:41,261 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 02:12:56,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:12:56,750 INFO L93 Difference]: Finished difference Result 1534 states and 1788 transitions. [2024-11-28 02:12:56,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 02:12:56,751 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 02:12:56,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:12:56,752 INFO L225 Difference]: With dead ends: 1534 [2024-11-28 02:12:56,752 INFO L226 Difference]: Without dead ends: 1534 [2024-11-28 02:12:56,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=218, Invalid=1417, Unknown=49, NotChecked=968, Total=2652 [2024-11-28 02:12:56,754 INFO L435 NwaCegarLoop]: 1041 mSDtfsCounter, 1592 mSDsluCounter, 9822 mSDsCounter, 0 mSdLazyCounter, 7168 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 70.9s 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, 72.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:12:56,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1605 Valid, 10863 Invalid, 7216 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 7168 Invalid, 0 Unknown, 0 Unchecked, 72.2s Time] [2024-11-28 02:12:56,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2024-11-28 02:12:56,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1492. [2024-11-28 02:12:56,776 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 02:12:56,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1740 transitions. [2024-11-28 02:12:56,778 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1740 transitions. Word has length 106 [2024-11-28 02:12:56,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:12:56,779 INFO L471 AbstractCegarLoop]: Abstraction has 1492 states and 1740 transitions. [2024-11-28 02:12:56,779 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 02:12:56,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1740 transitions. [2024-11-28 02:12:56,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-28 02:12:56,780 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:12:56,781 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 02:12:56,790 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-28 02:12:56,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:12:56,981 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 02:12:56,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:12:56,982 INFO L85 PathProgramCache]: Analyzing trace with hash 101128131, now seen corresponding path program 1 times [2024-11-28 02:12:56,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:12:56,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808118283] [2024-11-28 02:12:56,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:12:56,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:12:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:12:57,283 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 02:12:57,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:12:57,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808118283] [2024-11-28 02:12:57,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808118283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:12:57,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:12:57,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:12:57,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838210143] [2024-11-28 02:12:57,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:12:57,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:12:57,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:12:57,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:12:57,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:12:57,285 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 02:13:11,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:13:11,242 INFO L93 Difference]: Finished difference Result 1491 states and 1739 transitions. [2024-11-28 02:13:11,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:13:11,242 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 02:13:11,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:13:11,244 INFO L225 Difference]: With dead ends: 1491 [2024-11-28 02:13:11,244 INFO L226 Difference]: Without dead ends: 1491 [2024-11-28 02:13:11,244 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 02:13:11,244 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 5 mSDsluCounter, 3480 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s 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.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:13:11,245 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.8s Time] [2024-11-28 02:13:11,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2024-11-28 02:13:11,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1491. [2024-11-28 02:13:11,255 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 02:13:11,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 1739 transitions. [2024-11-28 02:13:11,257 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 1739 transitions. Word has length 108 [2024-11-28 02:13:11,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:13:11,257 INFO L471 AbstractCegarLoop]: Abstraction has 1491 states and 1739 transitions. [2024-11-28 02:13:11,258 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 02:13:11,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1739 transitions. [2024-11-28 02:13:11,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-28 02:13:11,258 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:13:11,258 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 02:13:11,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-28 02:13:11,259 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 02:13:11,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:13:11,259 INFO L85 PathProgramCache]: Analyzing trace with hash 101128132, now seen corresponding path program 1 times [2024-11-28 02:13:11,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:13:11,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227750701] [2024-11-28 02:13:11,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:13:11,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:13:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:13:16,286 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 02:13:16,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:13:16,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227750701] [2024-11-28 02:13:16,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227750701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:13:16,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:13:16,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 02:13:16,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730983601] [2024-11-28 02:13:16,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:13:16,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 02:13:16,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:13:16,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 02:13:16,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-28 02:13:16,289 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 02:14:36,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:14:36,400 INFO L93 Difference]: Finished difference Result 1539 states and 1795 transitions. [2024-11-28 02:14:36,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 02:14:36,401 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 02:14:36,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:14:36,405 INFO L225 Difference]: With dead ends: 1539 [2024-11-28 02:14:36,405 INFO L226 Difference]: Without dead ends: 1539 [2024-11-28 02:14:36,405 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 02:14:36,406 INFO L435 NwaCegarLoop]: 1042 mSDtfsCounter, 1620 mSDsluCounter, 9391 mSDsCounter, 0 mSdLazyCounter, 7483 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 76.2s 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, 77.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:14:36,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1635 Valid, 10433 Invalid, 7513 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 7483 Invalid, 0 Unknown, 0 Unchecked, 77.5s Time] [2024-11-28 02:14:36,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2024-11-28 02:14:36,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1519. [2024-11-28 02:14:36,424 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 02:14:36,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 1768 transitions. [2024-11-28 02:14:36,426 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 1768 transitions. Word has length 108 [2024-11-28 02:14:36,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:14:36,426 INFO L471 AbstractCegarLoop]: Abstraction has 1519 states and 1768 transitions. [2024-11-28 02:14:36,426 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 02:14:36,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1768 transitions. [2024-11-28 02:14:36,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-28 02:14:36,427 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:14:36,427 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 02:14:36,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-28 02:14:36,428 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 02:14:36,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:14:36,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1159994538, now seen corresponding path program 1 times [2024-11-28 02:14:36,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:14:36,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176665827] [2024-11-28 02:14:36,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:14:36,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:14:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:14:42,094 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 02:14:42,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:14:42,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176665827] [2024-11-28 02:14:42,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176665827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:14:42,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:14:42,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 02:14:42,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878338426] [2024-11-28 02:14:42,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:14:42,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 02:14:42,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:14:42,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 02:14:42,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-28 02:14:42,096 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 02:15:50,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:15:50,868 INFO L93 Difference]: Finished difference Result 1539 states and 1795 transitions. [2024-11-28 02:15:50,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 02:15:50,869 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 02:15:50,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:15:50,871 INFO L225 Difference]: With dead ends: 1539 [2024-11-28 02:15:50,871 INFO L226 Difference]: Without dead ends: 1539 [2024-11-28 02:15:50,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2024-11-28 02:15:50,872 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.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:15:50,872 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.7s Time] [2024-11-28 02:15:50,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2024-11-28 02:15:50,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1520. [2024-11-28 02:15:50,891 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 02:15:50,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 1771 transitions. [2024-11-28 02:15:50,894 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 1771 transitions. Word has length 109 [2024-11-28 02:15:50,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:15:50,895 INFO L471 AbstractCegarLoop]: Abstraction has 1520 states and 1771 transitions. [2024-11-28 02:15:50,895 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 02:15:50,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1771 transitions. [2024-11-28 02:15:50,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-28 02:15:50,896 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:15:50,896 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 02:15:50,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-28 02:15:50,896 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 02:15:50,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:15:50,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1159994537, now seen corresponding path program 1 times [2024-11-28 02:15:50,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:15:50,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548140471] [2024-11-28 02:15:50,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:15:50,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:15:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:15:56,902 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 02:15:56,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:15:56,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548140471] [2024-11-28 02:15:56,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548140471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:15:56,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:15:56,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-28 02:15:56,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945466148] [2024-11-28 02:15:56,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:15:56,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 02:15:56,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:15:56,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 02:15:56,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2024-11-28 02:15:56,905 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 02:17:15,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:17:15,125 INFO L93 Difference]: Finished difference Result 1538 states and 1794 transitions. [2024-11-28 02:17:15,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-28 02:17:15,126 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 02:17:15,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:17:15,128 INFO L225 Difference]: With dead ends: 1538 [2024-11-28 02:17:15,128 INFO L226 Difference]: Without dead ends: 1538 [2024-11-28 02:17:15,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=166, Invalid=1166, Unknown=0, NotChecked=0, Total=1332 [2024-11-28 02:17:15,129 INFO L435 NwaCegarLoop]: 1045 mSDtfsCounter, 1588 mSDsluCounter, 9590 mSDsCounter, 0 mSdLazyCounter, 7226 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 73.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, 74.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:17:15,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1603 Valid, 10635 Invalid, 7258 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [32 Valid, 7226 Invalid, 0 Unknown, 0 Unchecked, 74.4s Time] [2024-11-28 02:17:15,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2024-11-28 02:17:15,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1520. [2024-11-28 02:17:15,143 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 02:17:15,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 1770 transitions. [2024-11-28 02:17:15,145 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 1770 transitions. Word has length 109 [2024-11-28 02:17:15,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:17:15,145 INFO L471 AbstractCegarLoop]: Abstraction has 1520 states and 1770 transitions. [2024-11-28 02:17:15,145 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 02:17:15,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1770 transitions. [2024-11-28 02:17:15,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-28 02:17:15,146 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:17:15,146 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 02:17:15,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-28 02:17:15,147 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 02:17:15,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:17:15,147 INFO L85 PathProgramCache]: Analyzing trace with hash 273095480, now seen corresponding path program 1 times [2024-11-28 02:17:15,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:17:15,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737854844] [2024-11-28 02:17:15,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:17:15,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:17:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:17:15,799 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 02:17:15,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:17:15,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737854844] [2024-11-28 02:17:15,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737854844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:17:15,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:17:15,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:17:15,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690655993] [2024-11-28 02:17:15,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:17:15,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:17:15,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:17:15,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:17:15,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:17:15,802 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 02:17:29,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:17:29,742 INFO L93 Difference]: Finished difference Result 1519 states and 1769 transitions. [2024-11-28 02:17:29,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:17:29,743 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 02:17:29,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:17:29,746 INFO L225 Difference]: With dead ends: 1519 [2024-11-28 02:17:29,746 INFO L226 Difference]: Without dead ends: 1519 [2024-11-28 02:17:29,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:17:29,747 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 4 mSDsluCounter, 3494 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.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, 13.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:17:29,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5101 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 13.8s Time] [2024-11-28 02:17:29,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2024-11-28 02:17:29,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1519. [2024-11-28 02:17:29,766 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 02:17:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 1769 transitions. [2024-11-28 02:17:29,769 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 1769 transitions. Word has length 109 [2024-11-28 02:17:29,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:17:29,769 INFO L471 AbstractCegarLoop]: Abstraction has 1519 states and 1769 transitions. [2024-11-28 02:17:29,769 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 02:17:29,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1769 transitions. [2024-11-28 02:17:29,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-28 02:17:29,771 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:17:29,771 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 02:17:29,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-28 02:17:29,771 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 02:17:29,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:17:29,772 INFO L85 PathProgramCache]: Analyzing trace with hash -123974046, now seen corresponding path program 1 times [2024-11-28 02:17:29,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:17:29,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289764694] [2024-11-28 02:17:29,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:17:29,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:17:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:17:35,335 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 02:17:35,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:17:35,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289764694] [2024-11-28 02:17:35,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289764694] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:17:35,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623929668] [2024-11-28 02:17:35,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:17:35,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:17:35,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:17:35,338 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:17:35,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 02:17:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:17:35,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-28 02:17:35,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:17:35,841 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 02:17:37,197 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:17:37,198 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 02:17:37,565 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 02:17:37,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 02:17:38,744 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:17:38,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-28 02:17:38,766 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 02:17:39,383 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:17:39,384 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 02:17:39,406 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 02:17:40,097 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:17:40,098 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 02:17:40,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:17:40,846 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:17:40,847 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 02:17:40,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:17:41,618 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:17:41,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 02:17:41,679 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 02:17:42,453 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 02:17:43,257 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-11-28 02:17:43,257 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 02:17:43,286 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 02:17:44,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:17:44,673 INFO L349 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2024-11-28 02:17:44,673 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 02:17:44,717 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 02:17:45,080 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 02:17:45,690 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-28 02:17:45,690 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 02:17:45,713 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 02:17:45,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:17:45,950 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 02:17:46,051 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 02:17:46,990 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 02:17:47,956 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 02:17:48,438 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 02:17:48,762 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 02:17:49,437 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 02:17:49,751 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 02:17:50,275 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 02:17:50,610 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 02:17:51,224 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 02:17:51,558 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 02:17:53,079 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 02:17:53,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623929668] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:17:53,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:17:53,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 31 [2024-11-28 02:17:53,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655585825] [2024-11-28 02:17:53,093 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:17:53,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-28 02:17:53,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:17:53,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-28 02:17:53,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1020, Unknown=14, NotChecked=900, Total=2070 [2024-11-28 02:17:53,094 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 02:19:44,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:19:44,474 INFO L93 Difference]: Finished difference Result 1535 states and 1791 transitions. [2024-11-28 02:19:44,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-28 02:19:44,474 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 02:19:44,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:19:44,477 INFO L225 Difference]: With dead ends: 1535 [2024-11-28 02:19:44,477 INFO L226 Difference]: Without dead ends: 1535 [2024-11-28 02:19:44,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=253, Invalid=2037, Unknown=14, NotChecked=1236, Total=3540 [2024-11-28 02:19:44,478 INFO L435 NwaCegarLoop]: 1044 mSDtfsCounter, 1585 mSDsluCounter, 16428 mSDsCounter, 0 mSdLazyCounter, 10162 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 104.7s 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, 106.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:19:44,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1598 Valid, 17472 Invalid, 10208 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [46 Valid, 10162 Invalid, 0 Unknown, 0 Unchecked, 106.4s Time] [2024-11-28 02:19:44,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2024-11-28 02:19:44,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1518. [2024-11-28 02:19:44,490 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 02:19:44,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1768 transitions. [2024-11-28 02:19:44,492 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1768 transitions. Word has length 110 [2024-11-28 02:19:44,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:19:44,492 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 1768 transitions. [2024-11-28 02:19:44,493 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 02:19:44,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1768 transitions. [2024-11-28 02:19:44,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-28 02:19:44,493 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:19:44,493 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 02:19:44,504 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 02:19:44,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2024-11-28 02:19:44,694 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 02:19:44,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:19:44,694 INFO L85 PathProgramCache]: Analyzing trace with hash -123974045, now seen corresponding path program 1 times [2024-11-28 02:19:44,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:19:44,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913468809] [2024-11-28 02:19:44,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:19:44,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:19:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:19:51,936 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 02:19:51,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:19:51,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913468809] [2024-11-28 02:19:51,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913468809] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:19:51,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397496889] [2024-11-28 02:19:51,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:19:51,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:19:51,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:19:51,940 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:19:51,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 02:19:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:19:52,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-28 02:19:52,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:19:52,512 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 02:19:54,137 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 02:19:54,137 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 02:19:54,526 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 02:19:54,550 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 02:19:55,867 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:19:55,868 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 02:19:55,892 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 02:19:56,583 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:19:56,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 02:19:56,610 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 02:19:57,327 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:19:57,327 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 02:19:57,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 02:19:58,091 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:19:58,092 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 02:19:58,116 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 02:19:58,859 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 02:19:58,859 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 02:19:58,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 02:19:59,553 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 02:20:00,418 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-11-28 02:20:00,419 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 02:20:00,470 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 02:20:01,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:20:01,604 INFO L349 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2024-11-28 02:20:01,604 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 02:20:01,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:20:01,644 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 02:20:02,883 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-28 02:20:02,883 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 02:20:02,919 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 02:20:02,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:20:04,880 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 02:20:05,234 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 02:20:07,119 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 [2024-11-28 02:20:12,581 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-28 02:20:12,583 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-28 02:20:12,584 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-28 02:20:12,593 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-28 02:20:12,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2024-11-28 02:20:12,786 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:947) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2024-11-28 02:20:12,794 INFO L158 Benchmark]: Toolchain (without parser) took 797314.77ms. Allocated memory was 117.4MB in the beginning and 780.1MB in the end (delta: 662.7MB). Free memory was 91.0MB in the beginning and 598.6MB in the end (delta: -507.6MB). Peak memory consumption was 158.7MB. Max. memory is 16.1GB. [2024-11-28 02:20:12,794 INFO L158 Benchmark]: CDTParser took 1.85ms. Allocated memory is still 167.8MB. Free memory is still 103.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:20:12,795 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1115.38ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 53.6MB in the end (delta: 37.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-28 02:20:12,795 INFO L158 Benchmark]: Boogie Procedure Inliner took 161.24ms. Allocated memory is still 117.4MB. Free memory was 53.6MB in the beginning and 42.4MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 02:20:12,795 INFO L158 Benchmark]: Boogie Preprocessor took 408.69ms. Allocated memory is still 117.4MB. Free memory was 42.4MB in the beginning and 65.7MB in the end (delta: -23.3MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-11-28 02:20:12,798 INFO L158 Benchmark]: RCFGBuilder took 5083.89ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 65.7MB in the beginning and 258.8MB in the end (delta: -193.1MB). Peak memory consumption was 199.9MB. Max. memory is 16.1GB. [2024-11-28 02:20:12,798 INFO L158 Benchmark]: TraceAbstraction took 790538.75ms. Allocated memory was 352.3MB in the beginning and 780.1MB in the end (delta: 427.8MB). Free memory was 256.4MB in the beginning and 598.6MB in the end (delta: -342.2MB). Peak memory consumption was 92.7MB. Max. memory is 16.1GB. [2024-11-28 02:20:12,800 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.85ms. Allocated memory is still 167.8MB. Free memory is still 103.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1115.38ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 53.6MB in the end (delta: 37.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 161.24ms. Allocated memory is still 117.4MB. Free memory was 53.6MB in the beginning and 42.4MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 408.69ms. Allocated memory is still 117.4MB. Free memory was 42.4MB in the beginning and 65.7MB in the end (delta: -23.3MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * RCFGBuilder took 5083.89ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 65.7MB in the beginning and 258.8MB in the end (delta: -193.1MB). Peak memory consumption was 199.9MB. Max. memory is 16.1GB. * TraceAbstraction took 790538.75ms. Allocated memory was 352.3MB in the beginning and 780.1MB in the end (delta: 427.8MB). Free memory was 256.4MB in the beginning and 598.6MB in the end (delta: -342.2MB). Peak memory consumption was 92.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/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_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/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 1a17e1f9edfd37607fb472869452b377d4af1281c9808dec0371b4f943952037 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:20:15,928 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:20:16,079 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-28 02:20:16,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:20:16,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:20:16,144 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:20:16,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:20:16,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:20:16,146 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:20:16,147 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:20:16,148 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:20:16,148 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:20:16,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:20:16,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:20:16,149 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:20:16,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:20:16,150 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:20:16,151 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:20:16,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:20:16,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:20:16,151 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 02:20:16,151 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 02:20:16,152 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 02:20:16,152 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:20:16,152 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 02:20:16,152 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 02:20:16,152 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 02:20:16,152 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 02:20:16,153 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:20:16,153 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:20:16,153 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:20:16,153 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:20:16,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:20:16,153 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:20:16,153 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:20:16,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:20:16,154 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:20:16,154 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:20:16,154 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:20:16,154 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:20:16,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:20:16,154 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:20:16,154 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:20:16,154 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 02:20:16,154 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 02:20:16,154 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:20:16,155 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:20:16,155 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:20:16,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:20:16,155 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_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/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 -> 1a17e1f9edfd37607fb472869452b377d4af1281c9808dec0371b4f943952037 [2024-11-28 02:20:16,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:20:16,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:20:16,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:20:16,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:20:16,550 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:20:16,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i [2024-11-28 02:20:19,843 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/data/3ad9d8a32/9d45a73cbcba4e6ca1812aad323bd43d/FLAGff804f6bc [2024-11-28 02:20:20,209 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:20:20,210 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i [2024-11-28 02:20:20,232 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/data/3ad9d8a32/9d45a73cbcba4e6ca1812aad323bd43d/FLAGff804f6bc [2024-11-28 02:20:20,250 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/data/3ad9d8a32/9d45a73cbcba4e6ca1812aad323bd43d [2024-11-28 02:20:20,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:20:20,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:20:20,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:20:20,257 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:20:20,262 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:20:20,263 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:20:20" (1/1) ... [2024-11-28 02:20:20,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3933b307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:20:20, skipping insertion in model container [2024-11-28 02:20:20,265 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:20:20" (1/1) ... [2024-11-28 02:20:20,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:20:20,866 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 02:20:20,910 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 02:20:20,920 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 02:20:20,932 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 02:20:20,956 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 02:20:21,004 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 02:20:21,008 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 02:20:21,013 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 02:20:21,021 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 02:20:21,061 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 02:20:21,061 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 02:20:21,065 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 02:20:21,065 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 02:20:21,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:20:21,092 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:20:21,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:20:21,352 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:20:21,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:20:21 WrapperNode [2024-11-28 02:20:21,354 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:20:21,356 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:20:21,356 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:20:21,356 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:20:21,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:20:21" (1/1) ... [2024-11-28 02:20:21,429 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:20:21" (1/1) ... [2024-11-28 02:20:21,549 INFO L138 Inliner]: procedures = 180, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1399 [2024-11-28 02:20:21,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:20:21,550 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:20:21,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:20:21,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:20:21,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:20:21" (1/1) ... [2024-11-28 02:20:21,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:20:21" (1/1) ... [2024-11-28 02:20:21,583 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:20:21" (1/1) ... [2024-11-28 02:20:21,769 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 02:20:21,769 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:20:21" (1/1) ... [2024-11-28 02:20:21,769 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:20:21" (1/1) ... [2024-11-28 02:20:21,825 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:20:21" (1/1) ... [2024-11-28 02:20:21,828 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:20:21" (1/1) ... [2024-11-28 02:20:21,840 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:20:21" (1/1) ... [2024-11-28 02:20:21,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:20:21" (1/1) ... [2024-11-28 02:20:21,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:20:21" (1/1) ... [2024-11-28 02:20:21,884 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:20:21,887 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:20:21,887 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:20:21,887 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:20:21,890 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:20:21" (1/1) ... [2024-11-28 02:20:21,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:20:21,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:20:21,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:20:21,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:20:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-28 02:20:21,990 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-28 02:20:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-28 02:20:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-28 02:20:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-28 02:20:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-28 02:20:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-28 02:20:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-28 02:20:21,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 02:20:21,991 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 02:20:21,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-28 02:20:21,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-28 02:20:21,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-28 02:20:21,991 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-28 02:20:21,991 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-28 02:20:21,991 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-28 02:20:21,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 02:20:21,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:20:21,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 02:20:21,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 02:20:21,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 02:20:21,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 02:20:21,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 02:20:21,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 02:20:21,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 02:20:21,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 02:20:21,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-28 02:20:21,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-28 02:20:21,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-28 02:20:21,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 02:20:21,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 02:20:21,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-28 02:20:21,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:20:21,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:20:22,302 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:20:22,305 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:20:22,338 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:20:22,392 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:20:22,433 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 02:20:30,397 INFO L? ?]: Removed 1482 outVars from TransFormulas that were not future-live. [2024-11-28 02:20:30,397 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:20:30,462 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:20:30,466 INFO L312 CfgBuilder]: Removed 47 assume(true) statements. [2024-11-28 02:20:30,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:20:30 BoogieIcfgContainer [2024-11-28 02:20:30,467 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:20:30,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:20:30,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:20:30,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:20:30,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:20:20" (1/3) ... [2024-11-28 02:20:30,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ece6774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:20:30, skipping insertion in model container [2024-11-28 02:20:30,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:20:21" (2/3) ... [2024-11-28 02:20:30,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ece6774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:20:30, skipping insertion in model container [2024-11-28 02:20:30,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:20:30" (3/3) ... [2024-11-28 02:20:30,486 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test5-1.i [2024-11-28 02:20:30,506 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:20:30,508 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test5-1.i that has 6 procedures, 1454 locations, 1 initial locations, 49 loop locations, and 712 error locations. [2024-11-28 02:20:30,610 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:20:30,628 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;@718cc951, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:20:30,629 INFO L334 AbstractCegarLoop]: Starting to check reachability of 712 error locations. [2024-11-28 02:20:30,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 1444 states, 721 states have (on average 2.2094313453536754) internal successors, (1593), 1434 states have internal predecessors, (1593), 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 02:20:30,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 02:20:30,653 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:20:30,654 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 02:20:30,655 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 02:20:30,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:20:30,663 INFO L85 PathProgramCache]: Analyzing trace with hash 2009152842, now seen corresponding path program 1 times [2024-11-28 02:20:30,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:20:30,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1420807742] [2024-11-28 02:20:30,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:20:30,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:20:30,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:20:30,688 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:20:30,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:20:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:20:31,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 02:20:31,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:20:31,024 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 02:20:31,025 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:20:31,026 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:20:31,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420807742] [2024-11-28 02:20:31,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420807742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:20:31,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:20:31,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:20:31,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751111713] [2024-11-28 02:20:31,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:20:31,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 02:20:31,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:20:31,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 02:20:31,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:20:31,076 INFO L87 Difference]: Start difference. First operand has 1444 states, 721 states have (on average 2.2094313453536754) internal successors, (1593), 1434 states have internal predecessors, (1593), 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 02:20:31,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:20:31,207 INFO L93 Difference]: Finished difference Result 1424 states and 1506 transitions. [2024-11-28 02:20:31,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 02:20:31,209 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 02:20:31,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:20:31,231 INFO L225 Difference]: With dead ends: 1424 [2024-11-28 02:20:31,231 INFO L226 Difference]: Without dead ends: 1422 [2024-11-28 02:20:31,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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 02:20:31,237 INFO L435 NwaCegarLoop]: 1506 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, 1506 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 02:20:31,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:20:31,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2024-11-28 02:20:31,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1422. [2024-11-28 02:20:31,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 711 states have (on average 2.0815752461322083) internal successors, (1480), 1412 states have internal predecessors, (1480), 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 02:20:31,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 1504 transitions. [2024-11-28 02:20:31,384 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 1504 transitions. Word has length 6 [2024-11-28 02:20:31,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:20:31,385 INFO L471 AbstractCegarLoop]: Abstraction has 1422 states and 1504 transitions. [2024-11-28 02:20:31,385 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 02:20:31,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1504 transitions. [2024-11-28 02:20:31,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 02:20:31,386 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:20:31,386 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 02:20:31,398 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 02:20:31,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:20:31,591 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 02:20:31,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:20:31,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1954605546, now seen corresponding path program 1 times [2024-11-28 02:20:31,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:20:31,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [470218100] [2024-11-28 02:20:31,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:20:31,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:20:31,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:20:31,600 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:20:31,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2bc978a-ef97-43b6-96aa-44681e4f1d0b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:20:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:20:31,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 02:20:31,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:20:31,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 02:20:31,895 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 02:20:31,896 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:20:31,896 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:20:31,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470218100] [2024-11-28 02:20:31,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470218100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:20:31,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:20:31,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:20:31,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680763564] [2024-11-28 02:20:31,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:20:31,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:20:31,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:20:31,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:20:31,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:20:31,900 INFO L87 Difference]: Start difference. First operand 1422 states and 1504 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)