./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-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_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1 --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 fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 15:44:44,653 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 15:44:44,703 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-12-02 15:44:44,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 15:44:44,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 15:44:44,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 15:44:44,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 15:44:44,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 15:44:44,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 15:44:44,729 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 15:44:44,729 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 15:44:44,729 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 15:44:44,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 15:44:44,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 15:44:44,729 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 15:44:44,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 15:44:44,730 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 15:44:44,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 15:44:44,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 15:44:44,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 15:44:44,730 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-02 15:44:44,730 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-02 15:44:44,730 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-02 15:44:44,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 15:44:44,731 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 15:44:44,731 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 15:44:44,731 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 15:44:44,731 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 15:44:44,731 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 15:44:44,731 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 15:44:44,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 15:44:44,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 15:44:44,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 15:44:44,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 15:44:44,731 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 15:44:44,732 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 15:44:44,732 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 15:44:44,732 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 15:44:44,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 15:44:44,732 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 15:44:44,732 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 15:44:44,732 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 15:44:44,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 15:44:44,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 15:44:44,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 15:44:44,733 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 15:44:44,733 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 15:44:44,733 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_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1 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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2024-12-02 15:44:44,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 15:44:44,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 15:44:44,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 15:44:44,945 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 15:44:44,945 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 15:44:44,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i [2024-12-02 15:44:47,528 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/data/afecd15e8/fe3f24304ca548b09de1e4102524f647/FLAG60676f3ed [2024-12-02 15:44:47,806 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 15:44:47,807 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i [2024-12-02 15:44:47,820 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/data/afecd15e8/fe3f24304ca548b09de1e4102524f647/FLAG60676f3ed [2024-12-02 15:44:48,109 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/data/afecd15e8/fe3f24304ca548b09de1e4102524f647 [2024-12-02 15:44:48,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 15:44:48,111 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 15:44:48,113 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 15:44:48,113 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 15:44:48,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 15:44:48,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:44:48" (1/1) ... [2024-12-02 15:44:48,118 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513aab3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:48, skipping insertion in model container [2024-12-02 15:44:48,118 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:44:48" (1/1) ... [2024-12-02 15:44:48,153 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 15:44:48,442 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 15:44:48,472 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 15:44:48,476 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 15:44:48,480 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 15:44:48,486 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 15:44:48,498 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 15:44:48,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 15:44:48,512 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 15:44:48,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 15:44:48,610 INFO L204 MainTranslator]: Completed translation [2024-12-02 15:44:48,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:48 WrapperNode [2024-12-02 15:44:48,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 15:44:48,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 15:44:48,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 15:44:48,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 15:44:48,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:48" (1/1) ... [2024-12-02 15:44:48,632 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:48" (1/1) ... [2024-12-02 15:44:48,668 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 787 [2024-12-02 15:44:48,668 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 15:44:48,668 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 15:44:48,669 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 15:44:48,669 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 15:44:48,677 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:48" (1/1) ... [2024-12-02 15:44:48,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:48" (1/1) ... [2024-12-02 15:44:48,685 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:48" (1/1) ... [2024-12-02 15:44:48,720 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-12-02 15:44:48,720 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:48" (1/1) ... [2024-12-02 15:44:48,720 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:48" (1/1) ... [2024-12-02 15:44:48,742 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:48" (1/1) ... [2024-12-02 15:44:48,744 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:48" (1/1) ... [2024-12-02 15:44:48,752 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:48" (1/1) ... [2024-12-02 15:44:48,755 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:48" (1/1) ... [2024-12-02 15:44:48,758 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:48" (1/1) ... [2024-12-02 15:44:48,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 15:44:48,765 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 15:44:48,765 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 15:44:48,765 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 15:44:48,766 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:48" (1/1) ... [2024-12-02 15:44:48,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 15:44:48,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:44:48,788 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 15:44:48,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 15:44:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-12-02 15:44:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-12-02 15:44:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-12-02 15:44:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-12-02 15:44:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-12-02 15:44:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-12-02 15:44:48,809 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-12-02 15:44:48,809 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-12-02 15:44:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-02 15:44:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 15:44:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-12-02 15:44:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-12-02 15:44:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-12-02 15:44:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-12-02 15:44:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-02 15:44:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 15:44:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-12-02 15:44:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 15:44:48,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 15:44:48,948 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 15:44:48,949 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 15:44:48,951 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-12-02 15:44:48,983 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-12-02 15:44:50,318 INFO L? ?]: Removed 762 outVars from TransFormulas that were not future-live. [2024-12-02 15:44:50,318 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 15:44:50,339 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 15:44:50,339 INFO L312 CfgBuilder]: Removed 18 assume(true) statements. [2024-12-02 15:44:50,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:44:50 BoogieIcfgContainer [2024-12-02 15:44:50,340 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 15:44:50,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 15:44:50,341 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 15:44:50,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 15:44:50,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:44:48" (1/3) ... [2024-12-02 15:44:50,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594ab738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:44:50, skipping insertion in model container [2024-12-02 15:44:50,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:44:48" (2/3) ... [2024-12-02 15:44:50,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594ab738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:44:50, skipping insertion in model container [2024-12-02 15:44:50,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:44:50" (3/3) ... [2024-12-02 15:44:50,347 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test1-1.i [2024-12-02 15:44:50,361 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 15:44:50,363 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_nondet_test1-1.i that has 3 procedures, 743 locations, 1 initial locations, 20 loop locations, and 320 error locations. [2024-12-02 15:44:50,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 15:44:50,421 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;@68479421, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 15:44:50,421 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-12-02 15:44:50,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 738 states, 416 states have (on average 2.0600961538461537) internal successors, (857), 733 states have internal predecessors, (857), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 15:44:50,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-02 15:44:50,431 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:44:50,432 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-12-02 15:44:50,432 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:44:50,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:44:50,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103276, now seen corresponding path program 1 times [2024-12-02 15:44:50,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:44:50,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775539666] [2024-12-02 15:44:50,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:44:50,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:44:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:44:50,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:44:50,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:44:50,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775539666] [2024-12-02 15:44:50,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775539666] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:44:50,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:44:50,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 15:44:50,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649622797] [2024-12-02 15:44:50,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:44:50,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-02 15:44:50,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:44:50,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-02 15:44:50,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 15:44:50,588 INFO L87 Difference]: Start difference. First operand has 738 states, 416 states have (on average 2.0600961538461537) internal successors, (857), 733 states have internal predecessors, (857), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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-12-02 15:44:50,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:44:50,647 INFO L93 Difference]: Finished difference Result 728 states and 816 transitions. [2024-12-02 15:44:50,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-02 15:44:50,648 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-12-02 15:44:50,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:44:50,659 INFO L225 Difference]: With dead ends: 728 [2024-12-02 15:44:50,659 INFO L226 Difference]: Without dead ends: 726 [2024-12-02 15:44:50,661 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-12-02 15:44:50,664 INFO L435 NwaCegarLoop]: 816 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, 816 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-12-02 15:44:50,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 15:44:50,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2024-12-02 15:44:50,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2024-12-02 15:44:50,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 410 states have (on average 1.9707317073170731) internal successors, (808), 721 states have internal predecessors, (808), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 15:44:50,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 814 transitions. [2024-12-02 15:44:50,717 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 814 transitions. Word has length 6 [2024-12-02 15:44:50,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:44:50,717 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 814 transitions. [2024-12-02 15:44:50,717 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-12-02 15:44:50,717 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 814 transitions. [2024-12-02 15:44:50,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-02 15:44:50,717 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:44:50,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-12-02 15:44:50,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 15:44:50,718 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:44:50,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:44:50,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103338, now seen corresponding path program 1 times [2024-12-02 15:44:50,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:44:50,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956800577] [2024-12-02 15:44:50,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:44:50,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:44:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:44:50,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:44:50,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:44:50,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956800577] [2024-12-02 15:44:50,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956800577] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:44:50,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:44:50,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 15:44:50,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818793712] [2024-12-02 15:44:50,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:44:50,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:44:50,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:44:50,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:44:50,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:44:50,796 INFO L87 Difference]: Start difference. First operand 726 states and 814 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-12-02 15:44:51,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:44:51,361 INFO L93 Difference]: Finished difference Result 680 states and 769 transitions. [2024-12-02 15:44:51,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:44:51,362 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-12-02 15:44:51,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:44:51,364 INFO L225 Difference]: With dead ends: 680 [2024-12-02 15:44:51,364 INFO L226 Difference]: Without dead ends: 680 [2024-12-02 15:44:51,364 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-12-02 15:44:51,365 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 679 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 15:44:51,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 469 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 15:44:51,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-12-02 15:44:51,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 677. [2024-12-02 15:44:51,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 410 states have (on average 1.851219512195122) internal successors, (759), 672 states have internal predecessors, (759), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 15:44:51,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 765 transitions. [2024-12-02 15:44:51,384 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 765 transitions. Word has length 6 [2024-12-02 15:44:51,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:44:51,384 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 765 transitions. [2024-12-02 15:44:51,385 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-12-02 15:44:51,385 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 765 transitions. [2024-12-02 15:44:51,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-02 15:44:51,385 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:44:51,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-12-02 15:44:51,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 15:44:51,385 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:44:51,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:44:51,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103339, now seen corresponding path program 1 times [2024-12-02 15:44:51,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:44:51,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782335767] [2024-12-02 15:44:51,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:44:51,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:44:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:44:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:44:51,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:44:51,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782335767] [2024-12-02 15:44:51,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782335767] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:44:51,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:44:51,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 15:44:51,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085743699] [2024-12-02 15:44:51,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:44:51,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:44:51,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:44:51,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:44:51,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:44:51,477 INFO L87 Difference]: Start difference. First operand 677 states and 765 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-12-02 15:44:51,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:44:51,928 INFO L93 Difference]: Finished difference Result 755 states and 849 transitions. [2024-12-02 15:44:51,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:44:51,928 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-12-02 15:44:51,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:44:51,930 INFO L225 Difference]: With dead ends: 755 [2024-12-02 15:44:51,930 INFO L226 Difference]: Without dead ends: 755 [2024-12-02 15:44:51,930 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-12-02 15:44:51,931 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 417 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 15:44:51,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 831 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 15:44:51,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2024-12-02 15:44:51,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 706. [2024-12-02 15:44:51,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 450 states have (on average 1.8377777777777777) internal successors, (827), 701 states have internal predecessors, (827), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 15:44:51,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 833 transitions. [2024-12-02 15:44:51,951 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 833 transitions. Word has length 6 [2024-12-02 15:44:51,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:44:51,951 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 833 transitions. [2024-12-02 15:44:51,951 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-12-02 15:44:51,951 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 833 transitions. [2024-12-02 15:44:51,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-02 15:44:51,952 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:44:51,952 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-12-02 15:44:51,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 15:44:51,952 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr314REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:44:51,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:44:51,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1423421085, now seen corresponding path program 1 times [2024-12-02 15:44:51,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:44:51,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301324423] [2024-12-02 15:44:51,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:44:51,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:44:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:44:51,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:44:51,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:44:51,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301324423] [2024-12-02 15:44:51,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301324423] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:44:51,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:44:51,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 15:44:51,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430758387] [2024-12-02 15:44:51,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:44:51,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:44:51,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:44:51,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:44:51,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:44:51,983 INFO L87 Difference]: Start difference. First operand 706 states and 833 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-12-02 15:44:52,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:44:52,020 INFO L93 Difference]: Finished difference Result 1388 states and 1641 transitions. [2024-12-02 15:44:52,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:44:52,020 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-12-02 15:44:52,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:44:52,026 INFO L225 Difference]: With dead ends: 1388 [2024-12-02 15:44:52,026 INFO L226 Difference]: Without dead ends: 1388 [2024-12-02 15:44:52,026 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-12-02 15:44:52,027 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 722 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 15:44:52,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1500 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 15:44:52,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-12-02 15:44:52,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 707. [2024-12-02 15:44:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 451 states have (on average 1.835920177383592) internal successors, (828), 702 states have internal predecessors, (828), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 15:44:52,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 834 transitions. [2024-12-02 15:44:52,054 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 834 transitions. Word has length 6 [2024-12-02 15:44:52,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:44:52,054 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 834 transitions. [2024-12-02 15:44:52,054 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-12-02 15:44:52,054 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 834 transitions. [2024-12-02 15:44:52,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-02 15:44:52,055 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:44:52,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:44:52,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 15:44:52,055 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:44:52,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:44:52,055 INFO L85 PathProgramCache]: Analyzing trace with hash 247711511, now seen corresponding path program 1 times [2024-12-02 15:44:52,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:44:52,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372466386] [2024-12-02 15:44:52,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:44:52,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:44:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:44:52,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:44:52,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:44:52,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372466386] [2024-12-02 15:44:52,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372466386] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:44:52,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:44:52,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 15:44:52,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282503917] [2024-12-02 15:44:52,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:44:52,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 15:44:52,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:44:52,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 15:44:52,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 15:44:52,144 INFO L87 Difference]: Start difference. First operand 707 states and 834 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-12-02 15:44:52,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:44:52,666 INFO L93 Difference]: Finished difference Result 734 states and 888 transitions. [2024-12-02 15:44:52,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 15:44:52,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2024-12-02 15:44:52,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:44:52,669 INFO L225 Difference]: With dead ends: 734 [2024-12-02 15:44:52,669 INFO L226 Difference]: Without dead ends: 734 [2024-12-02 15:44:52,669 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-12-02 15:44:52,670 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 943 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 15:44:52,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 735 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 15:44:52,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2024-12-02 15:44:52,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 684. [2024-12-02 15:44:52,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 451 states have (on average 1.7849223946784922) internal successors, (805), 679 states have internal predecessors, (805), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 15:44:52,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 811 transitions. [2024-12-02 15:44:52,689 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 811 transitions. Word has length 16 [2024-12-02 15:44:52,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:44:52,689 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 811 transitions. [2024-12-02 15:44:52,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-12-02 15:44:52,689 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 811 transitions. [2024-12-02 15:44:52,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-02 15:44:52,690 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:44:52,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:44:52,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 15:44:52,690 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:44:52,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:44:52,690 INFO L85 PathProgramCache]: Analyzing trace with hash 247711512, now seen corresponding path program 1 times [2024-12-02 15:44:52,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:44:52,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132392612] [2024-12-02 15:44:52,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:44:52,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:44:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:44:52,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:44:52,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:44:52,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132392612] [2024-12-02 15:44:52,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132392612] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:44:52,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:44:52,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 15:44:52,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547581346] [2024-12-02 15:44:52,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:44:52,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:44:52,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:44:52,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:44:52,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:44:52,775 INFO L87 Difference]: Start difference. First operand 684 states and 811 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-12-02 15:44:52,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:44:52,803 INFO L93 Difference]: Finished difference Result 609 states and 708 transitions. [2024-12-02 15:44:52,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:44:52,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2024-12-02 15:44:52,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:44:52,806 INFO L225 Difference]: With dead ends: 609 [2024-12-02 15:44:52,806 INFO L226 Difference]: Without dead ends: 609 [2024-12-02 15:44:52,806 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-12-02 15:44:52,808 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 61 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1179 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-12-02 15:44:52,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1179 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 15:44:52,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-12-02 15:44:52,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-12-02 15:44:52,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 388 states have (on average 1.809278350515464) internal successors, (702), 604 states have internal predecessors, (702), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 15:44:52,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 708 transitions. [2024-12-02 15:44:52,824 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 708 transitions. Word has length 16 [2024-12-02 15:44:52,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:44:52,824 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 708 transitions. [2024-12-02 15:44:52,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-12-02 15:44:52,825 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 708 transitions. [2024-12-02 15:44:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-02 15:44:52,825 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:44:52,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:44:52,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 15:44:52,825 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:44:52,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:44:52,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1827838193, now seen corresponding path program 1 times [2024-12-02 15:44:52,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:44:52,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787155716] [2024-12-02 15:44:52,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:44:52,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:44:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:44:52,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:44:52,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:44:52,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787155716] [2024-12-02 15:44:52,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787155716] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:44:52,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:44:52,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 15:44:52,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450365120] [2024-12-02 15:44:52,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:44:52,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 15:44:52,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:44:52,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 15:44:52,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 15:44:52,893 INFO L87 Difference]: Start difference. First operand 609 states and 708 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-12-02 15:44:52,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:44:52,954 INFO L93 Difference]: Finished difference Result 591 states and 683 transitions. [2024-12-02 15:44:52,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 15:44:52,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2024-12-02 15:44:52,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:44:52,957 INFO L225 Difference]: With dead ends: 591 [2024-12-02 15:44:52,957 INFO L226 Difference]: Without dead ends: 591 [2024-12-02 15:44:52,957 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-12-02 15:44:52,958 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 41 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 15:44:52,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1715 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 15:44:52,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-12-02 15:44:52,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 588. [2024-12-02 15:44:52,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 374 states have (on average 1.8021390374331552) internal successors, (674), 583 states have internal predecessors, (674), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 15:44:52,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 680 transitions. [2024-12-02 15:44:52,969 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 680 transitions. Word has length 18 [2024-12-02 15:44:52,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:44:52,969 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 680 transitions. [2024-12-02 15:44:52,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-12-02 15:44:52,970 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 680 transitions. [2024-12-02 15:44:52,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-02 15:44:52,970 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:44:52,970 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] [2024-12-02 15:44:52,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 15:44:52,970 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:44:52,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:44:52,971 INFO L85 PathProgramCache]: Analyzing trace with hash -385577985, now seen corresponding path program 1 times [2024-12-02 15:44:52,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:44:52,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274632512] [2024-12-02 15:44:52,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:44:52,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:44:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:44:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:44:53,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:44:53,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274632512] [2024-12-02 15:44:53,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274632512] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:44:53,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:44:53,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 15:44:53,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320629029] [2024-12-02 15:44:53,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:44:53,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 15:44:53,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:44:53,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 15:44:53,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 15:44:53,111 INFO L87 Difference]: Start difference. First operand 588 states and 680 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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-12-02 15:44:53,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:44:53,595 INFO L93 Difference]: Finished difference Result 682 states and 768 transitions. [2024-12-02 15:44:53,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 15:44:53,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-12-02 15:44:53,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:44:53,597 INFO L225 Difference]: With dead ends: 682 [2024-12-02 15:44:53,597 INFO L226 Difference]: Without dead ends: 682 [2024-12-02 15:44:53,597 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-12-02 15:44:53,597 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 418 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 15:44:53,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1016 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 15:44:53,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2024-12-02 15:44:53,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 584. [2024-12-02 15:44:53,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 374 states have (on average 1.7914438502673797) internal successors, (670), 579 states have internal predecessors, (670), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 15:44:53,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 676 transitions. [2024-12-02 15:44:53,610 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 676 transitions. Word has length 32 [2024-12-02 15:44:53,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:44:53,610 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 676 transitions. [2024-12-02 15:44:53,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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-12-02 15:44:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 676 transitions. [2024-12-02 15:44:53,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-12-02 15:44:53,612 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:44:53,612 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] [2024-12-02 15:44:53,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 15:44:53,612 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:44:53,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:44:53,612 INFO L85 PathProgramCache]: Analyzing trace with hash 945049781, now seen corresponding path program 1 times [2024-12-02 15:44:53,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:44:53,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775774543] [2024-12-02 15:44:53,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:44:53,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:44:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:44:53,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:44:53,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:44:53,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775774543] [2024-12-02 15:44:53,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775774543] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:44:53,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:44:53,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 15:44:53,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777800870] [2024-12-02 15:44:53,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:44:53,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 15:44:53,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:44:53,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 15:44:53,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 15:44:53,733 INFO L87 Difference]: Start difference. First operand 584 states and 676 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-12-02 15:44:53,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:44:53,777 INFO L93 Difference]: Finished difference Result 584 states and 672 transitions. [2024-12-02 15:44:53,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 15:44:53,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2024-12-02 15:44:53,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:44:53,780 INFO L225 Difference]: With dead ends: 584 [2024-12-02 15:44:53,780 INFO L226 Difference]: Without dead ends: 584 [2024-12-02 15:44:53,780 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-12-02 15:44:53,780 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 21 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1697 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-12-02 15:44:53,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1697 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 15:44:53,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-12-02 15:44:53,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2024-12-02 15:44:53,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 374 states have (on average 1.7807486631016043) internal successors, (666), 579 states have internal predecessors, (666), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 15:44:53,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 672 transitions. [2024-12-02 15:44:53,791 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 672 transitions. Word has length 66 [2024-12-02 15:44:53,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:44:53,791 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 672 transitions. [2024-12-02 15:44:53,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-12-02 15:44:53,792 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 672 transitions. [2024-12-02 15:44:53,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-12-02 15:44:53,793 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:44:53,793 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] [2024-12-02 15:44:53,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 15:44:53,793 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:44:53,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:44:53,793 INFO L85 PathProgramCache]: Analyzing trace with hash -729166719, now seen corresponding path program 1 times [2024-12-02 15:44:53,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:44:53,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623688602] [2024-12-02 15:44:53,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:44:53,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:44:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:44:53,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:44:53,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:44:53,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623688602] [2024-12-02 15:44:53,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623688602] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:44:53,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:44:53,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 15:44:53,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548089599] [2024-12-02 15:44:53,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:44:53,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:44:53,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:44:53,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:44:53,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:44:53,924 INFO L87 Difference]: Start difference. First operand 584 states and 672 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-12-02 15:44:53,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:44:53,959 INFO L93 Difference]: Finished difference Result 681 states and 796 transitions. [2024-12-02 15:44:53,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:44:53,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 74 [2024-12-02 15:44:53,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:44:53,962 INFO L225 Difference]: With dead ends: 681 [2024-12-02 15:44:53,962 INFO L226 Difference]: Without dead ends: 681 [2024-12-02 15:44:53,962 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-12-02 15:44:53,963 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 54 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 15:44:53,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1154 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 15:44:53,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-12-02 15:44:53,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2024-12-02 15:44:53,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 471 states have (on average 1.6772823779193207) internal successors, (790), 676 states have internal predecessors, (790), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 15:44:53,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 796 transitions. [2024-12-02 15:44:53,975 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 796 transitions. Word has length 74 [2024-12-02 15:44:53,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:44:53,975 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 796 transitions. [2024-12-02 15:44:53,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-12-02 15:44:53,975 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 796 transitions. [2024-12-02 15:44:53,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-12-02 15:44:53,976 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:44:53,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] [2024-12-02 15:44:53,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 15:44:53,976 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:44:53,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:44:53,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1229812623, now seen corresponding path program 1 times [2024-12-02 15:44:53,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:44:53,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67939544] [2024-12-02 15:44:53,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:44:53,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:44:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:44:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:44:54,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:44:54,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67939544] [2024-12-02 15:44:54,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67939544] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:44:54,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:44:54,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:44:54,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045642519] [2024-12-02 15:44:54,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:44:54,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:44:54,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:44:54,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:44:54,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:44:54,474 INFO L87 Difference]: Start difference. First operand 681 states and 796 transitions. Second operand has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 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-12-02 15:44:55,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:44:55,025 INFO L93 Difference]: Finished difference Result 643 states and 758 transitions. [2024-12-02 15:44:55,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 15:44:55,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 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 77 [2024-12-02 15:44:55,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:44:55,028 INFO L225 Difference]: With dead ends: 643 [2024-12-02 15:44:55,028 INFO L226 Difference]: Without dead ends: 643 [2024-12-02 15:44:55,028 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-12-02 15:44:55,029 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 938 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 15:44:55,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 473 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 15:44:55,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2024-12-02 15:44:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 603. [2024-12-02 15:44:55,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 431 states have (on average 1.5614849187935034) internal successors, (673), 598 states have internal predecessors, (673), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 15:44:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 679 transitions. [2024-12-02 15:44:55,040 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 679 transitions. Word has length 77 [2024-12-02 15:44:55,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:44:55,041 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 679 transitions. [2024-12-02 15:44:55,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 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-12-02 15:44:55,041 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 679 transitions. [2024-12-02 15:44:55,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-12-02 15:44:55,042 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:44:55,042 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] [2024-12-02 15:44:55,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 15:44:55,042 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:44:55,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:44:55,042 INFO L85 PathProgramCache]: Analyzing trace with hash -795601644, now seen corresponding path program 1 times [2024-12-02 15:44:55,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:44:55,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156559816] [2024-12-02 15:44:55,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:44:55,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:44:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:44:55,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:44:55,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:44:55,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156559816] [2024-12-02 15:44:55,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156559816] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:44:55,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:44:55,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 15:44:55,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112636578] [2024-12-02 15:44:55,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:44:55,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 15:44:55,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:44:55,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 15:44:55,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 15:44:55,357 INFO L87 Difference]: Start difference. First operand 603 states and 679 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 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-12-02 15:44:55,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:44:55,804 INFO L93 Difference]: Finished difference Result 602 states and 678 transitions. [2024-12-02 15:44:55,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:44:55,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 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 82 [2024-12-02 15:44:55,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:44:55,806 INFO L225 Difference]: With dead ends: 602 [2024-12-02 15:44:55,806 INFO L226 Difference]: Without dead ends: 602 [2024-12-02 15:44:55,806 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-12-02 15:44:55,807 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 2 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 15:44:55,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1510 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 15:44:55,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-12-02 15:44:55,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2024-12-02 15:44:55,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 431 states have (on average 1.5591647331786542) internal successors, (672), 597 states have internal predecessors, (672), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 15:44:55,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 678 transitions. [2024-12-02 15:44:55,817 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 678 transitions. Word has length 82 [2024-12-02 15:44:55,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:44:55,817 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 678 transitions. [2024-12-02 15:44:55,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 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-12-02 15:44:55,818 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 678 transitions. [2024-12-02 15:44:55,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-12-02 15:44:55,819 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:44:55,819 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] [2024-12-02 15:44:55,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 15:44:55,819 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:44:55,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:44:55,819 INFO L85 PathProgramCache]: Analyzing trace with hash -795601643, now seen corresponding path program 1 times [2024-12-02 15:44:55,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:44:55,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311238296] [2024-12-02 15:44:55,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:44:55,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:44:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:44:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:44:56,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:44:56,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311238296] [2024-12-02 15:44:56,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311238296] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:44:56,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:44:56,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 15:44:56,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464230262] [2024-12-02 15:44:56,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:44:56,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 15:44:56,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:44:56,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 15:44:56,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 15:44:56,290 INFO L87 Difference]: Start difference. First operand 602 states and 678 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 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-12-02 15:44:56,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:44:56,792 INFO L93 Difference]: Finished difference Result 601 states and 677 transitions. [2024-12-02 15:44:56,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:44:56,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 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 82 [2024-12-02 15:44:56,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:44:56,794 INFO L225 Difference]: With dead ends: 601 [2024-12-02 15:44:56,794 INFO L226 Difference]: Without dead ends: 601 [2024-12-02 15:44:56,794 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-12-02 15:44:56,795 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 1 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 15:44:56,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1519 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 15:44:56,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-12-02 15:44:56,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2024-12-02 15:44:56,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 430 states have (on average 1.5604651162790697) internal successors, (671), 596 states have internal predecessors, (671), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 15:44:56,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 677 transitions. [2024-12-02 15:44:56,803 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 677 transitions. Word has length 82 [2024-12-02 15:44:56,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:44:56,803 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 677 transitions. [2024-12-02 15:44:56,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 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-12-02 15:44:56,803 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 677 transitions. [2024-12-02 15:44:56,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-02 15:44:56,804 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:44:56,804 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-12-02 15:44:56,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 15:44:56,804 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:44:56,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:44:56,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1932962117, now seen corresponding path program 1 times [2024-12-02 15:44:56,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:44:56,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055521382] [2024-12-02 15:44:56,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:44:56,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:44:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:44:56,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:44:56,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:44:56,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055521382] [2024-12-02 15:44:56,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055521382] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:44:56,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:44:56,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 15:44:56,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729725893] [2024-12-02 15:44:56,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:44:56,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 15:44:56,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:44:56,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 15:44:56,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-12-02 15:44:56,976 INFO L87 Difference]: Start difference. First operand 601 states and 677 transitions. Second operand has 7 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 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-12-02 15:44:57,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:44:57,599 INFO L93 Difference]: Finished difference Result 613 states and 692 transitions. [2024-12-02 15:44:57,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 15:44:57,599 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 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-12-02 15:44:57,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:44:57,602 INFO L225 Difference]: With dead ends: 613 [2024-12-02 15:44:57,602 INFO L226 Difference]: Without dead ends: 613 [2024-12-02 15:44:57,603 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-12-02 15:44:57,603 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 6 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2363 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 15:44:57,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2363 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-02 15:44:57,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-12-02 15:44:57,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 607. [2024-12-02 15:44:57,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 435 states have (on average 1.5586206896551724) internal successors, (678), 601 states have internal predecessors, (678), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-12-02 15:44:57,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 687 transitions. [2024-12-02 15:44:57,616 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 687 transitions. Word has length 90 [2024-12-02 15:44:57,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:44:57,616 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 687 transitions. [2024-12-02 15:44:57,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 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-12-02 15:44:57,616 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 687 transitions. [2024-12-02 15:44:57,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-02 15:44:57,617 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:44:57,617 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-12-02 15:44:57,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 15:44:57,617 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:44:57,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:44:57,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1932962116, now seen corresponding path program 1 times [2024-12-02 15:44:57,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:44:57,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577753761] [2024-12-02 15:44:57,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:44:57,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:44:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:44:58,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:44:58,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:44:58,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577753761] [2024-12-02 15:44:58,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577753761] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:44:58,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:44:58,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:44:58,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259420960] [2024-12-02 15:44:58,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:44:58,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:44:58,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:44:58,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:44:58,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:44:58,120 INFO L87 Difference]: Start difference. First operand 607 states and 687 transitions. Second operand has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 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-12-02 15:44:58,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:44:58,690 INFO L93 Difference]: Finished difference Result 607 states and 686 transitions. [2024-12-02 15:44:58,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:44:58,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 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-12-02 15:44:58,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:44:58,692 INFO L225 Difference]: With dead ends: 607 [2024-12-02 15:44:58,692 INFO L226 Difference]: Without dead ends: 607 [2024-12-02 15:44:58,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-12-02 15:44:58,693 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 1 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1955 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 15:44:58,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1955 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 15:44:58,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-12-02 15:44:58,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2024-12-02 15:44:58,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 435 states have (on average 1.5563218390804598) internal successors, (677), 601 states have internal predecessors, (677), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-12-02 15:44:58,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 686 transitions. [2024-12-02 15:44:58,705 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 686 transitions. Word has length 90 [2024-12-02 15:44:58,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:44:58,705 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 686 transitions. [2024-12-02 15:44:58,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 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-12-02 15:44:58,705 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 686 transitions. [2024-12-02 15:44:58,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-12-02 15:44:58,706 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:44:58,706 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] [2024-12-02 15:44:58,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 15:44:58,706 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:44:58,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:44:58,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1489621638, now seen corresponding path program 1 times [2024-12-02 15:44:58,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:44:58,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172944828] [2024-12-02 15:44:58,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:44:58,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:44:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:44:59,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:44:59,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:44:59,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172944828] [2024-12-02 15:44:59,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172944828] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:44:59,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803439734] [2024-12-02 15:44:59,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:44:59,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:44:59,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:44:59,123 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:44:59,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 15:44:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:44:59,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-12-02 15:44:59,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:44:59,444 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 15:44:59,445 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-12-02 15:44:59,458 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-12-02 15:44:59,526 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:44:59,526 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-12-02 15:44:59,557 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-12-02 15:44:59,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:44:59,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:44:59,608 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-12-02 15:44:59,609 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-12-02 15:44:59,616 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_502) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_#t~mem51#1.base|)) is different from false [2024-12-02 15:44:59,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803439734] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:44:59,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 15:44:59,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2024-12-02 15:44:59,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290029782] [2024-12-02 15:44:59,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 15:44:59,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-12-02 15:44:59,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:44:59,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-12-02 15:44:59,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2024-12-02 15:44:59,620 INFO L87 Difference]: Start difference. First operand 607 states and 686 transitions. Second operand has 14 states, 12 states have (on average 8.666666666666666) internal successors, (104), 13 states have internal predecessors, (104), 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-12-02 15:45:00,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:45:00,794 INFO L93 Difference]: Finished difference Result 606 states and 685 transitions. [2024-12-02 15:45:00,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 15:45:00,795 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.666666666666666) internal successors, (104), 13 states have internal predecessors, (104), 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 91 [2024-12-02 15:45:00,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:45:00,797 INFO L225 Difference]: With dead ends: 606 [2024-12-02 15:45:00,797 INFO L226 Difference]: Without dead ends: 606 [2024-12-02 15:45:00,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=342, Unknown=1, NotChecked=38, Total=462 [2024-12-02 15:45:00,798 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 502 mSDsluCounter, 2494 mSDsCounter, 0 mSdLazyCounter, 2122 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 2821 SdHoareTripleChecker+Invalid, 2137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-12-02 15:45:00,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 2821 Invalid, 2137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2122 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-12-02 15:45:00,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-12-02 15:45:00,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-12-02 15:45:00,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 435 states have (on average 1.554022988505747) internal successors, (676), 600 states have internal predecessors, (676), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-12-02 15:45:00,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 685 transitions. [2024-12-02 15:45:00,810 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 685 transitions. Word has length 91 [2024-12-02 15:45:00,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:45:00,810 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 685 transitions. [2024-12-02 15:45:00,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.666666666666666) internal successors, (104), 13 states have internal predecessors, (104), 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-12-02 15:45:00,811 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 685 transitions. [2024-12-02 15:45:00,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-12-02 15:45:00,811 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:45:00,811 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] [2024-12-02 15:45:00,821 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 15:45:01,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-12-02 15:45:01,012 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:45:01,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:45:01,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1489621639, now seen corresponding path program 1 times [2024-12-02 15:45:01,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:45:01,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56489032] [2024-12-02 15:45:01,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:45:01,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:45:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:45:01,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:45:01,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:45:01,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56489032] [2024-12-02 15:45:01,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56489032] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:45:01,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065119542] [2024-12-02 15:45:01,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:45:01,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:45:01,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:45:01,758 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:45:01,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 15:45:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:45:01,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-12-02 15:45:01,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:45:02,047 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 15:45:02,047 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-12-02 15:45:02,053 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-12-02 15:45:02,064 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-12-02 15:45:02,070 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-12-02 15:45:02,132 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-12-02 15:45:02,138 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-12-02 15:45:02,241 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:02,241 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-12-02 15:45:02,246 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-12-02 15:45:02,275 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-12-02 15:45:02,280 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-12-02 15:45:02,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:45:02,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:45:02,375 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_629 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-12-02 15:45:02,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065119542] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:45:02,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 15:45:02,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2024-12-02 15:45:02,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135006029] [2024-12-02 15:45:02,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 15:45:02,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-12-02 15:45:02,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:45:02,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-12-02 15:45:02,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2024-12-02 15:45:02,380 INFO L87 Difference]: Start difference. First operand 606 states and 685 transitions. Second operand has 15 states, 12 states have (on average 9.166666666666666) internal successors, (110), 15 states have internal predecessors, (110), 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-12-02 15:45:03,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:45:03,618 INFO L93 Difference]: Finished difference Result 613 states and 692 transitions. [2024-12-02 15:45:03,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 15:45:03,619 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.166666666666666) internal successors, (110), 15 states have internal predecessors, (110), 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 91 [2024-12-02 15:45:03,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:45:03,621 INFO L225 Difference]: With dead ends: 613 [2024-12-02 15:45:03,621 INFO L226 Difference]: Without dead ends: 613 [2024-12-02 15:45:03,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2024-12-02 15:45:03,621 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 495 mSDsluCounter, 1889 mSDsCounter, 0 mSdLazyCounter, 2178 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-12-02 15:45:03,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 2218 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2178 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-12-02 15:45:03,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-12-02 15:45:03,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 604. [2024-12-02 15:45:03,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 434 states have (on average 1.5529953917050692) internal successors, (674), 598 states have internal predecessors, (674), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 15:45:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 680 transitions. [2024-12-02 15:45:03,630 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 680 transitions. Word has length 91 [2024-12-02 15:45:03,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:45:03,630 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 680 transitions. [2024-12-02 15:45:03,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.166666666666666) internal successors, (110), 15 states have internal predecessors, (110), 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-12-02 15:45:03,631 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 680 transitions. [2024-12-02 15:45:03,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-12-02 15:45:03,631 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:45:03,631 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-12-02 15:45:03,637 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 15:45:03,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-12-02 15:45:03,832 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:45:03,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:45:03,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2047694902, now seen corresponding path program 1 times [2024-12-02 15:45:03,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:45:03,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206988697] [2024-12-02 15:45:03,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:45:03,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:45:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:45:04,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:45:04,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:45:04,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206988697] [2024-12-02 15:45:04,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206988697] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:45:04,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:45:04,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-12-02 15:45:04,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323199527] [2024-12-02 15:45:04,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:45:04,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-12-02 15:45:04,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:45:04,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-12-02 15:45:04,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-12-02 15:45:04,224 INFO L87 Difference]: Start difference. First operand 604 states and 680 transitions. Second operand has 14 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 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-12-02 15:45:05,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:45:05,119 INFO L93 Difference]: Finished difference Result 617 states and 696 transitions. [2024-12-02 15:45:05,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 15:45:05,119 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 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-12-02 15:45:05,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:45:05,121 INFO L225 Difference]: With dead ends: 617 [2024-12-02 15:45:05,121 INFO L226 Difference]: Without dead ends: 617 [2024-12-02 15:45:05,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-12-02 15:45:05,122 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 502 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 1914 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 2507 SdHoareTripleChecker+Invalid, 1928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-12-02 15:45:05,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 2507 Invalid, 1928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1914 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-12-02 15:45:05,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-12-02 15:45:05,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2024-12-02 15:45:05,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 442 states have (on average 1.5475113122171946) internal successors, (684), 606 states have internal predecessors, (684), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 15:45:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 691 transitions. [2024-12-02 15:45:05,130 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 691 transitions. Word has length 93 [2024-12-02 15:45:05,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:45:05,130 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 691 transitions. [2024-12-02 15:45:05,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 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-12-02 15:45:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 691 transitions. [2024-12-02 15:45:05,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-12-02 15:45:05,131 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:45:05,131 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-12-02 15:45:05,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 15:45:05,131 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:45:05,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:45:05,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2047694903, now seen corresponding path program 1 times [2024-12-02 15:45:05,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:45:05,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112756943] [2024-12-02 15:45:05,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:45:05,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:45:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:45:05,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:45:05,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:45:05,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112756943] [2024-12-02 15:45:05,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112756943] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:45:05,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:45:05,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 15:45:05,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281219960] [2024-12-02 15:45:05,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:45:05,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 15:45:05,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:45:05,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 15:45:05,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-12-02 15:45:05,586 INFO L87 Difference]: Start difference. First operand 613 states and 691 transitions. Second operand has 11 states, 10 states have (on average 9.1) internal successors, (91), 11 states have internal predecessors, (91), 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-12-02 15:45:06,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:45:06,613 INFO L93 Difference]: Finished difference Result 616 states and 695 transitions. [2024-12-02 15:45:06,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 15:45:06,614 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.1) internal successors, (91), 11 states have internal predecessors, (91), 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-12-02 15:45:06,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:45:06,616 INFO L225 Difference]: With dead ends: 616 [2024-12-02 15:45:06,616 INFO L226 Difference]: Without dead ends: 616 [2024-12-02 15:45:06,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-12-02 15:45:06,616 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 479 mSDsluCounter, 1565 mSDsCounter, 0 mSdLazyCounter, 1956 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 1895 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-12-02 15:45:06,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 1895 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1956 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-12-02 15:45:06,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-12-02 15:45:06,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 613. [2024-12-02 15:45:06,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 442 states have (on average 1.5452488687782806) internal successors, (683), 606 states have internal predecessors, (683), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 15:45:06,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 690 transitions. [2024-12-02 15:45:06,626 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 690 transitions. Word has length 93 [2024-12-02 15:45:06,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:45:06,626 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 690 transitions. [2024-12-02 15:45:06,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.1) internal successors, (91), 11 states have internal predecessors, (91), 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-12-02 15:45:06,626 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 690 transitions. [2024-12-02 15:45:06,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-02 15:45:06,627 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:45:06,627 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] [2024-12-02 15:45:06,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-02 15:45:06,627 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:45:06,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:45:06,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1716733067, now seen corresponding path program 1 times [2024-12-02 15:45:06,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:45:06,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194483552] [2024-12-02 15:45:06,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:45:06,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:45:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:45:07,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:45:07,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:45:07,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194483552] [2024-12-02 15:45:07,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194483552] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:45:07,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836235029] [2024-12-02 15:45:07,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:45:07,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:45:07,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:45:07,118 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:45:07,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 15:45:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:45:07,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-12-02 15:45:07,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:45:07,391 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 15:45:07,391 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-12-02 15:45:07,398 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-12-02 15:45:07,451 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:07,451 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-12-02 15:45:07,497 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:07,497 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-12-02 15:45:07,511 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-12-02 15:45:07,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:45:07,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:45:07,524 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_878) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-12-02 15:45:07,586 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-12-02 15:45:07,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 33 treesize of output 32 [2024-12-02 15:45:07,591 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_881 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#1.base| (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~mem51#1.base| v_ArrVal_881))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_878)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-12-02 15:45:07,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836235029] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:45:07,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 15:45:07,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2024-12-02 15:45:07,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836361853] [2024-12-02 15:45:07,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 15:45:07,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-12-02 15:45:07,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:45:07,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-12-02 15:45:07,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=225, Unknown=6, NotChecked=62, Total=342 [2024-12-02 15:45:07,593 INFO L87 Difference]: Start difference. First operand 613 states and 690 transitions. Second operand has 16 states, 14 states have (on average 7.785714285714286) internal successors, (109), 15 states have internal predecessors, (109), 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-12-02 15:45:08,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:45:08,793 INFO L93 Difference]: Finished difference Result 615 states and 694 transitions. [2024-12-02 15:45:08,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 15:45:08,794 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.785714285714286) internal successors, (109), 15 states have internal predecessors, (109), 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 94 [2024-12-02 15:45:08,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:45:08,795 INFO L225 Difference]: With dead ends: 615 [2024-12-02 15:45:08,795 INFO L226 Difference]: Without dead ends: 615 [2024-12-02 15:45:08,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=451, Unknown=6, NotChecked=90, Total=650 [2024-12-02 15:45:08,796 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 496 mSDsluCounter, 3065 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 3391 SdHoareTripleChecker+Invalid, 2604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-12-02 15:45:08,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 3391 Invalid, 2604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2590 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-12-02 15:45:08,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-12-02 15:45:08,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 612. [2024-12-02 15:45:08,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 442 states have (on average 1.5429864253393666) internal successors, (682), 605 states have internal predecessors, (682), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 15:45:08,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 689 transitions. [2024-12-02 15:45:08,803 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 689 transitions. Word has length 94 [2024-12-02 15:45:08,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:45:08,803 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 689 transitions. [2024-12-02 15:45:08,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.785714285714286) internal successors, (109), 15 states have internal predecessors, (109), 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-12-02 15:45:08,803 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 689 transitions. [2024-12-02 15:45:08,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-02 15:45:08,804 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:45:08,804 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] [2024-12-02 15:45:08,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 15:45:09,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:45:09,005 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:45:09,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:45:09,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1716733068, now seen corresponding path program 1 times [2024-12-02 15:45:09,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:45:09,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045279522] [2024-12-02 15:45:09,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:45:09,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:45:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:45:09,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:45:09,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:45:09,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045279522] [2024-12-02 15:45:09,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045279522] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:45:09,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53067106] [2024-12-02 15:45:09,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:45:09,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:45:09,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:45:09,594 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:45:09,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 15:45:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:45:09,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-12-02 15:45:09,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:45:09,866 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 15:45:09,866 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-12-02 15:45:09,887 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-12-02 15:45:09,890 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-12-02 15:45:10,048 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:10,048 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-12-02 15:45:10,052 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-12-02 15:45:10,133 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:10,133 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-12-02 15:45:10,142 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-12-02 15:45:10,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-12-02 15:45:10,160 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-12-02 15:45:10,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:45:10,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:45:10,235 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1016 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1015 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1016) |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~mem53#1.base| v_ArrVal_1015) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-12-02 15:45:10,246 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_1016 (Array Int Int)) (v_ArrVal_1015 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1016) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1015) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1016 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1016) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2024-12-02 15:45:10,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 15:45:10,328 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 84 treesize of output 88 [2024-12-02 15:45:10,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53067106] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:45:10,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 15:45:10,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2024-12-02 15:45:10,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017030276] [2024-12-02 15:45:10,428 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 15:45:10,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-12-02 15:45:10,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:45:10,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-12-02 15:45:10,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=478, Unknown=2, NotChecked=90, Total=650 [2024-12-02 15:45:10,429 INFO L87 Difference]: Start difference. First operand 612 states and 689 transitions. Second operand has 21 states, 18 states have (on average 6.777777777777778) internal successors, (122), 21 states have internal predecessors, (122), 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-12-02 15:45:12,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:45:12,096 INFO L93 Difference]: Finished difference Result 614 states and 693 transitions. [2024-12-02 15:45:12,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 15:45:12,097 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 6.777777777777778) internal successors, (122), 21 states have internal predecessors, (122), 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 94 [2024-12-02 15:45:12,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:45:12,099 INFO L225 Difference]: With dead ends: 614 [2024-12-02 15:45:12,099 INFO L226 Difference]: Without dead ends: 614 [2024-12-02 15:45:12,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=690, Unknown=2, NotChecked=110, Total=930 [2024-12-02 15:45:12,100 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 474 mSDsluCounter, 3248 mSDsCounter, 0 mSdLazyCounter, 3528 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 3572 SdHoareTripleChecker+Invalid, 3547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-12-02 15:45:12,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 3572 Invalid, 3547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3528 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-12-02 15:45:12,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-12-02 15:45:12,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 602. [2024-12-02 15:45:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 434 states have (on average 1.5483870967741935) internal successors, (672), 596 states have internal predecessors, (672), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 15:45:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 678 transitions. [2024-12-02 15:45:12,109 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 678 transitions. Word has length 94 [2024-12-02 15:45:12,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:45:12,109 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 678 transitions. [2024-12-02 15:45:12,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 6.777777777777778) internal successors, (122), 21 states have internal predecessors, (122), 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-12-02 15:45:12,109 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 678 transitions. [2024-12-02 15:45:12,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-12-02 15:45:12,110 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:45:12,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] [2024-12-02 15:45:12,119 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 15:45:12,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-12-02 15:45:12,310 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:45:12,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:45:12,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1458945026, now seen corresponding path program 1 times [2024-12-02 15:45:12,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:45:12,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982720291] [2024-12-02 15:45:12,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:45:12,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:45:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:45:12,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:45:12,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:45:12,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982720291] [2024-12-02 15:45:12,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982720291] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:45:12,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:45:12,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-12-02 15:45:12,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976061965] [2024-12-02 15:45:12,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:45:12,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-12-02 15:45:12,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:45:12,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-12-02 15:45:12,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-12-02 15:45:12,701 INFO L87 Difference]: Start difference. First operand 602 states and 678 transitions. Second operand has 15 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 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-12-02 15:45:13,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:45:13,671 INFO L93 Difference]: Finished difference Result 618 states and 697 transitions. [2024-12-02 15:45:13,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 15:45:13,671 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 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 96 [2024-12-02 15:45:13,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:45:13,673 INFO L225 Difference]: With dead ends: 618 [2024-12-02 15:45:13,673 INFO L226 Difference]: Without dead ends: 618 [2024-12-02 15:45:13,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-12-02 15:45:13,675 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 503 mSDsluCounter, 2177 mSDsCounter, 0 mSdLazyCounter, 1915 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 2502 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-12-02 15:45:13,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 2502 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1915 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-12-02 15:45:13,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-12-02 15:45:13,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 614. [2024-12-02 15:45:13,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 445 states have (on average 1.5393258426966292) internal successors, (685), 607 states have internal predecessors, (685), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 15:45:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 692 transitions. [2024-12-02 15:45:13,682 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 692 transitions. Word has length 96 [2024-12-02 15:45:13,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:45:13,682 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 692 transitions. [2024-12-02 15:45:13,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 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-12-02 15:45:13,682 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 692 transitions. [2024-12-02 15:45:13,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-12-02 15:45:13,682 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:45:13,682 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-12-02 15:45:13,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-02 15:45:13,682 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:45:13,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:45:13,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1458945027, now seen corresponding path program 1 times [2024-12-02 15:45:13,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:45:13,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657203353] [2024-12-02 15:45:13,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:45:13,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:45:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:45:14,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:45:14,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:45:14,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657203353] [2024-12-02 15:45:14,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657203353] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:45:14,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:45:14,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-12-02 15:45:14,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302523911] [2024-12-02 15:45:14,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:45:14,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 15:45:14,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:45:14,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 15:45:14,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-12-02 15:45:14,143 INFO L87 Difference]: Start difference. First operand 614 states and 692 transitions. Second operand has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 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-12-02 15:45:15,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:45:15,184 INFO L93 Difference]: Finished difference Result 617 states and 696 transitions. [2024-12-02 15:45:15,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 15:45:15,185 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 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 96 [2024-12-02 15:45:15,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:45:15,187 INFO L225 Difference]: With dead ends: 617 [2024-12-02 15:45:15,187 INFO L226 Difference]: Without dead ends: 617 [2024-12-02 15:45:15,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-12-02 15:45:15,187 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 497 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 2129 SdHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-12-02 15:45:15,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 2129 Invalid, 2278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-12-02 15:45:15,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-12-02 15:45:15,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 614. [2024-12-02 15:45:15,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 445 states have (on average 1.5370786516853931) internal successors, (684), 607 states have internal predecessors, (684), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 15:45:15,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 691 transitions. [2024-12-02 15:45:15,195 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 691 transitions. Word has length 96 [2024-12-02 15:45:15,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:45:15,195 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 691 transitions. [2024-12-02 15:45:15,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 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-12-02 15:45:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 691 transitions. [2024-12-02 15:45:15,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-12-02 15:45:15,196 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:45:15,196 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] [2024-12-02 15:45:15,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-02 15:45:15,196 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:45:15,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:45:15,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1275137139, now seen corresponding path program 1 times [2024-12-02 15:45:15,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:45:15,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535450709] [2024-12-02 15:45:15,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:45:15,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:45:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:45:15,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:45:15,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:45:15,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535450709] [2024-12-02 15:45:15,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535450709] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:45:15,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673184645] [2024-12-02 15:45:15,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:45:15,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:45:15,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:45:15,602 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:45:15,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 15:45:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:45:15,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-12-02 15:45:15,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:45:15,838 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 15:45:15,839 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-12-02 15:45:15,844 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-12-02 15:45:15,884 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:15,884 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-12-02 15:45:15,922 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:15,922 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-12-02 15:45:15,958 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:15,958 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-12-02 15:45:15,965 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-12-02 15:45:15,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:45:15,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:45:16,021 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int))) (= (select |c_#valid| (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~mem53#1.base| v_ArrVal_1294))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1295)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-12-02 15:45:16,028 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1295 (Array Int Int)) (v_ArrVal_1294 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1294))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1295)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-12-02 15:45:16,058 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-12-02 15:45:16,058 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 57 treesize of output 56 [2024-12-02 15:45:16,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673184645] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:45:16,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 15:45:16,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 17 [2024-12-02 15:45:16,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313068553] [2024-12-02 15:45:16,096 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 15:45:16,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-12-02 15:45:16,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:45:16,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-12-02 15:45:16,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=337, Unknown=22, NotChecked=78, Total=506 [2024-12-02 15:45:16,097 INFO L87 Difference]: Start difference. First operand 614 states and 691 transitions. Second operand has 18 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 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-12-02 15:45:17,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:45:17,249 INFO L93 Difference]: Finished difference Result 616 states and 695 transitions. [2024-12-02 15:45:17,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 15:45:17,249 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 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 97 [2024-12-02 15:45:17,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:45:17,251 INFO L225 Difference]: With dead ends: 616 [2024-12-02 15:45:17,251 INFO L226 Difference]: Without dead ends: 616 [2024-12-02 15:45:17,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=661, Unknown=22, NotChecked=110, Total=930 [2024-12-02 15:45:17,252 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 474 mSDsluCounter, 3069 mSDsCounter, 0 mSdLazyCounter, 2594 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 3394 SdHoareTripleChecker+Invalid, 2608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-12-02 15:45:17,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 3394 Invalid, 2608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2594 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-12-02 15:45:17,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-12-02 15:45:17,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 613. [2024-12-02 15:45:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 445 states have (on average 1.5348314606741573) internal successors, (683), 606 states have internal predecessors, (683), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 15:45:17,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 690 transitions. [2024-12-02 15:45:17,257 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 690 transitions. Word has length 97 [2024-12-02 15:45:17,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:45:17,257 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 690 transitions. [2024-12-02 15:45:17,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 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-12-02 15:45:17,257 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 690 transitions. [2024-12-02 15:45:17,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-12-02 15:45:17,257 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:45:17,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] [2024-12-02 15:45:17,264 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 15:45:17,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-12-02 15:45:17,458 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:45:17,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:45:17,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1275137138, now seen corresponding path program 1 times [2024-12-02 15:45:17,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:45:17,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492113041] [2024-12-02 15:45:17,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:45:17,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:45:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:45:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:45:18,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:45:18,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492113041] [2024-12-02 15:45:18,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492113041] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:45:18,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593122267] [2024-12-02 15:45:18,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:45:18,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:45:18,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:45:18,045 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:45:18,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 15:45:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:45:18,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-12-02 15:45:18,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:45:18,277 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-12-02 15:45:18,283 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 15:45:18,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 15:45:18,304 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-12-02 15:45:18,308 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-12-02 15:45:18,381 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-12-02 15:45:18,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-12-02 15:45:18,468 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:18,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-12-02 15:45:18,473 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-12-02 15:45:18,536 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:18,536 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-12-02 15:45:18,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 15:45:18,588 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:18,588 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-12-02 15:45:18,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 15:45:18,608 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-12-02 15:45:18,612 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-12-02 15:45:18,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:45:18,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:45:18,680 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1447 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1448) |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~mem54#1.base| v_ArrVal_1447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1448 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))))) is different from false [2024-12-02 15:45:18,690 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_1448 (Array Int Int)) (v_ArrVal_1447 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1448 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) is different from false [2024-12-02 15:45:18,708 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1445))) (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~mem53#1.base| v_ArrVal_1446) .cse0 v_ArrVal_1448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1446) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1445) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2024-12-02 15:45:18,721 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_1448 (Array Int Int)) (v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1446) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1445) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1445))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1446) .cse2 v_ArrVal_1448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-12-02 15:45:18,765 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1454))) (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~mem51#1.base| v_ArrVal_1453) .cse0 v_ArrVal_1446) (select (select (store .cse1 .cse0 v_ArrVal_1445) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1448))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1448 (Array Int Int)) (v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1454))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1445))) (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~mem51#1.base| v_ArrVal_1453) .cse3 v_ArrVal_1446) .cse4 v_ArrVal_1448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1447) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-12-02 15:45:18,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593122267] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:45:18,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 15:45:18,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2024-12-02 15:45:18,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160745566] [2024-12-02 15:45:18,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 15:45:18,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-12-02 15:45:18,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:45:18,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-12-02 15:45:18,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=479, Unknown=5, NotChecked=240, Total=812 [2024-12-02 15:45:18,769 INFO L87 Difference]: Start difference. First operand 613 states and 690 transitions. Second operand has 22 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 22 states have internal predecessors, (128), 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-12-02 15:45:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:45:20,355 INFO L93 Difference]: Finished difference Result 615 states and 694 transitions. [2024-12-02 15:45:20,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 15:45:20,355 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 22 states have internal predecessors, (128), 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 97 [2024-12-02 15:45:20,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:45:20,357 INFO L225 Difference]: With dead ends: 615 [2024-12-02 15:45:20,357 INFO L226 Difference]: Without dead ends: 615 [2024-12-02 15:45:20,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=744, Unknown=5, NotChecked=300, Total=1190 [2024-12-02 15:45:20,357 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 493 mSDsluCounter, 2601 mSDsCounter, 0 mSdLazyCounter, 3116 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 2928 SdHoareTripleChecker+Invalid, 3135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-12-02 15:45:20,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 2928 Invalid, 3135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3116 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-12-02 15:45:20,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-12-02 15:45:20,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 600. [2024-12-02 15:45:20,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 434 states have (on average 1.543778801843318) internal successors, (670), 594 states have internal predecessors, (670), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 15:45:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 676 transitions. [2024-12-02 15:45:20,362 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 676 transitions. Word has length 97 [2024-12-02 15:45:20,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:45:20,362 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 676 transitions. [2024-12-02 15:45:20,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 22 states have internal predecessors, (128), 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-12-02 15:45:20,362 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 676 transitions. [2024-12-02 15:45:20,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-02 15:45:20,362 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:45:20,363 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-12-02 15:45:20,369 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 15:45:20,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-12-02 15:45:20,563 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:45:20,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:45:20,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1637134370, now seen corresponding path program 1 times [2024-12-02 15:45:20,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:45:20,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680949841] [2024-12-02 15:45:20,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:45:20,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:45:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:45:21,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:45:21,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:45:21,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680949841] [2024-12-02 15:45:21,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680949841] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:45:21,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:45:21,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-12-02 15:45:21,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579113870] [2024-12-02 15:45:21,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:45:21,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 15:45:21,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:45:21,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 15:45:21,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-12-02 15:45:21,164 INFO L87 Difference]: Start difference. First operand 600 states and 676 transitions. Second operand has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 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-12-02 15:45:22,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:45:22,574 INFO L93 Difference]: Finished difference Result 619 states and 698 transitions. [2024-12-02 15:45:22,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 15:45:22,574 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 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-12-02 15:45:22,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:45:22,575 INFO L225 Difference]: With dead ends: 619 [2024-12-02 15:45:22,576 INFO L226 Difference]: Without dead ends: 619 [2024-12-02 15:45:22,576 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-12-02 15:45:22,576 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 482 mSDsluCounter, 2315 mSDsCounter, 0 mSdLazyCounter, 2806 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 2643 SdHoareTripleChecker+Invalid, 2818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-12-02 15:45:22,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 2643 Invalid, 2818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2806 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-12-02 15:45:22,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-12-02 15:45:22,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 615. [2024-12-02 15:45:22,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 448 states have (on average 1.53125) internal successors, (686), 608 states have internal predecessors, (686), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 15:45:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 693 transitions. [2024-12-02 15:45:22,580 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 693 transitions. Word has length 99 [2024-12-02 15:45:22,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:45:22,581 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 693 transitions. [2024-12-02 15:45:22,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 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-12-02 15:45:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 693 transitions. [2024-12-02 15:45:22,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-02 15:45:22,581 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:45:22,581 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-12-02 15:45:22,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-02 15:45:22,581 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:45:22,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:45:22,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1637134371, now seen corresponding path program 1 times [2024-12-02 15:45:22,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:45:22,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742093767] [2024-12-02 15:45:22,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:45:22,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:45:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:45:22,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:45:22,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:45:22,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742093767] [2024-12-02 15:45:22,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742093767] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:45:22,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:45:22,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-12-02 15:45:22,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495586399] [2024-12-02 15:45:22,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:45:22,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-12-02 15:45:22,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:45:22,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-12-02 15:45:22,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-12-02 15:45:22,984 INFO L87 Difference]: Start difference. First operand 615 states and 693 transitions. Second operand has 16 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-12-02 15:45:24,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:45:24,004 INFO L93 Difference]: Finished difference Result 618 states and 697 transitions. [2024-12-02 15:45:24,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 15:45:24,005 INFO L78 Accepts]: Start accepts. Automaton has has 16 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-12-02 15:45:24,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:45:24,006 INFO L225 Difference]: With dead ends: 618 [2024-12-02 15:45:24,006 INFO L226 Difference]: Without dead ends: 618 [2024-12-02 15:45:24,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2024-12-02 15:45:24,006 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 484 mSDsluCounter, 2790 mSDsCounter, 0 mSdLazyCounter, 2370 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 3115 SdHoareTripleChecker+Invalid, 2384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-12-02 15:45:24,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 3115 Invalid, 2384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2370 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-12-02 15:45:24,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-12-02 15:45:24,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 615. [2024-12-02 15:45:24,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 448 states have (on average 1.5290178571428572) internal successors, (685), 608 states have internal predecessors, (685), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 15:45:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 692 transitions. [2024-12-02 15:45:24,012 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 692 transitions. Word has length 99 [2024-12-02 15:45:24,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:45:24,012 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 692 transitions. [2024-12-02 15:45:24,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 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-12-02 15:45:24,013 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 692 transitions. [2024-12-02 15:45:24,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-12-02 15:45:24,013 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:45:24,013 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-12-02 15:45:24,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-02 15:45:24,013 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:45:24,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:45:24,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1375856755, now seen corresponding path program 1 times [2024-12-02 15:45:24,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:45:24,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443309266] [2024-12-02 15:45:24,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:45:24,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:45:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:45:24,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:45:24,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:45:24,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443309266] [2024-12-02 15:45:24,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443309266] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:45:24,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126759699] [2024-12-02 15:45:24,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:45:24,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:45:24,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:45:24,664 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:45:24,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 15:45:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:45:24,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-12-02 15:45:24,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:45:24,941 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-12-02 15:45:24,948 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 15:45:24,948 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-12-02 15:45:24,956 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-12-02 15:45:24,961 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-12-02 15:45:25,000 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-12-02 15:45:25,002 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-12-02 15:45:25,088 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:25,088 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-12-02 15:45:25,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-12-02 15:45:25,149 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:25,149 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-12-02 15:45:25,152 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-12-02 15:45:25,215 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:25,215 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-12-02 15:45:25,219 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-12-02 15:45:25,272 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:25,272 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-12-02 15:45:25,276 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-12-02 15:45:25,293 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-12-02 15:45:25,298 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-12-02 15:45:25,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:45:25,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:45:25,351 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1757) |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~mem55#1.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1757 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2024-12-02 15:45:25,360 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_1757 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1758) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-12-02 15:45:25,379 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1756))) (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~mem54#1.base| v_ArrVal_1755) .cse0 v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1758) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1755) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1756) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-12-02 15:45:25,479 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1753 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1753))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1756))) (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~mem53#1.base| v_ArrVal_1754) .cse0 v_ArrVal_1755) .cse1 v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1758) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1753 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1753))) (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~mem53#1.base| v_ArrVal_1754) .cse5 v_ArrVal_1755) (select (select (store .cse6 .cse5 v_ArrVal_1756) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1757))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2024-12-02 15:45:25,508 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |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|) .cse3))) (and (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1753 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1753))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1756))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1754) .cse1 v_ArrVal_1755) .cse2 v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1758) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1753 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1753))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1754) .cse6 v_ArrVal_1755) (select (select (store .cse7 .cse6 v_ArrVal_1756) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1757))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20)))))) is different from false [2024-12-02 15:45:25,620 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1753 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1764))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1753))) (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~mem51#1.base| v_ArrVal_1763) .cse0 v_ArrVal_1754) .cse1 v_ArrVal_1755) (select (select (store .cse2 .cse1 v_ArrVal_1756) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1757))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1757 (Array Int Int)) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1753 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1764))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1753))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1756))) (let ((.cse7 (select (select .cse8 |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~mem51#1.base| v_ArrVal_1763) .cse5 v_ArrVal_1754) .cse6 v_ArrVal_1755) .cse7 v_ArrVal_1757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1758) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-12-02 15:45:25,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126759699] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:45:25,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 15:45:25,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 19 [2024-12-02 15:45:25,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105731227] [2024-12-02 15:45:25,623 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 15:45:25,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-12-02 15:45:25,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:45:25,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-12-02 15:45:25,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=421, Unknown=13, NotChecked=282, Total=812 [2024-12-02 15:45:25,625 INFO L87 Difference]: Start difference. First operand 615 states and 692 transitions. Second operand has 20 states, 18 states have (on average 6.888888888888889) internal successors, (124), 20 states have internal predecessors, (124), 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-12-02 15:45:27,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:45:27,185 INFO L93 Difference]: Finished difference Result 617 states and 696 transitions. [2024-12-02 15:45:27,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 15:45:27,186 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 6.888888888888889) internal successors, (124), 20 states have internal predecessors, (124), 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-12-02 15:45:27,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:45:27,187 INFO L225 Difference]: With dead ends: 617 [2024-12-02 15:45:27,187 INFO L226 Difference]: Without dead ends: 617 [2024-12-02 15:45:27,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=725, Unknown=13, NotChecked=366, Total=1260 [2024-12-02 15:45:27,187 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 472 mSDsluCounter, 2124 mSDsCounter, 0 mSdLazyCounter, 2486 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 2450 SdHoareTripleChecker+Invalid, 2501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-12-02 15:45:27,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 2450 Invalid, 2501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2486 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-12-02 15:45:27,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-12-02 15:45:27,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 614. [2024-12-02 15:45:27,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 448 states have (on average 1.5267857142857142) internal successors, (684), 607 states have internal predecessors, (684), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 15:45:27,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 691 transitions. [2024-12-02 15:45:27,195 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 691 transitions. Word has length 100 [2024-12-02 15:45:27,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:45:27,195 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 691 transitions. [2024-12-02 15:45:27,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 6.888888888888889) internal successors, (124), 20 states have internal predecessors, (124), 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-12-02 15:45:27,195 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 691 transitions. [2024-12-02 15:45:27,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-12-02 15:45:27,196 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:45:27,196 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-12-02 15:45:27,201 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 15:45:27,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-12-02 15:45:27,396 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:45:27,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:45:27,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1375856754, now seen corresponding path program 1 times [2024-12-02 15:45:27,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:45:27,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177436718] [2024-12-02 15:45:27,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:45:27,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:45:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:45:27,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:45:27,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:45:27,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177436718] [2024-12-02 15:45:27,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177436718] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:45:27,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104167002] [2024-12-02 15:45:27,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:45:27,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:45:27,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:45:27,903 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:45:27,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 15:45:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:45:28,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-12-02 15:45:28,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:45:28,177 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 15:45:28,178 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-12-02 15:45:28,183 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-12-02 15:45:28,226 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:28,226 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-12-02 15:45:28,288 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:28,289 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-12-02 15:45:28,327 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:28,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 42 treesize of output 41 [2024-12-02 15:45:28,368 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:28,368 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-12-02 15:45:28,376 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-12-02 15:45:28,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:45:28,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:45:28,387 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1922 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1922) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-12-02 15:45:28,421 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int))) (= (select |c_#valid| (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~mem54#1.base| v_ArrVal_1921))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1922)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-12-02 15:45:28,425 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1921))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1922)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-12-02 15:45:28,432 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int)) (v_ArrVal_1920 (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~mem53#1.base| v_ArrVal_1920))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1921)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1922)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-12-02 15:45:28,500 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-12-02 15:45:28,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 104 [2024-12-02 15:45:28,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104167002] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:45:28,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 15:45:28,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 19 [2024-12-02 15:45:28,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333586078] [2024-12-02 15:45:28,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 15:45:28,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-12-02 15:45:28,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:45:28,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-12-02 15:45:28,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=407, Unknown=25, NotChecked=180, Total=702 [2024-12-02 15:45:28,555 INFO L87 Difference]: Start difference. First operand 614 states and 691 transitions. Second operand has 20 states, 18 states have (on average 6.611111111111111) internal successors, (119), 19 states have internal predecessors, (119), 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-12-02 15:45:29,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:45:29,769 INFO L93 Difference]: Finished difference Result 616 states and 695 transitions. [2024-12-02 15:45:29,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 15:45:29,770 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 6.611111111111111) internal successors, (119), 19 states have internal predecessors, (119), 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 100 [2024-12-02 15:45:29,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:45:29,771 INFO L225 Difference]: With dead ends: 616 [2024-12-02 15:45:29,771 INFO L226 Difference]: Without dead ends: 616 [2024-12-02 15:45:29,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=809, Unknown=25, NotChecked=252, Total=1260 [2024-12-02 15:45:29,771 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 485 mSDsluCounter, 2789 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 3113 SdHoareTripleChecker+Invalid, 2358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-12-02 15:45:29,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 3113 Invalid, 2358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2344 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-12-02 15:45:29,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-12-02 15:45:29,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 598. [2024-12-02 15:45:29,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 434 states have (on average 1.5391705069124424) internal successors, (668), 592 states have internal predecessors, (668), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 15:45:29,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 674 transitions. [2024-12-02 15:45:29,776 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 674 transitions. Word has length 100 [2024-12-02 15:45:29,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:45:29,776 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 674 transitions. [2024-12-02 15:45:29,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 6.611111111111111) internal successors, (119), 19 states have internal predecessors, (119), 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-12-02 15:45:29,776 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 674 transitions. [2024-12-02 15:45:29,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-02 15:45:29,777 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:45:29,777 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-12-02 15:45:29,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 15:45:29,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-12-02 15:45:29,977 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:45:29,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:45:29,978 INFO L85 PathProgramCache]: Analyzing trace with hash -679205281, now seen corresponding path program 1 times [2024-12-02 15:45:29,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:45:29,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477911273] [2024-12-02 15:45:29,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:45:29,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:45:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:45:30,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:45:30,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:45:30,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477911273] [2024-12-02 15:45:30,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477911273] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:45:30,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:45:30,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-12-02 15:45:30,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434293521] [2024-12-02 15:45:30,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:45:30,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-12-02 15:45:30,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:45:30,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-12-02 15:45:30,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-12-02 15:45:30,559 INFO L87 Difference]: Start difference. First operand 598 states and 674 transitions. Second operand has 17 states, 15 states have (on average 6.733333333333333) internal successors, (101), 16 states have internal predecessors, (101), 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-12-02 15:45:31,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:45:31,623 INFO L93 Difference]: Finished difference Result 621 states and 700 transitions. [2024-12-02 15:45:31,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 15:45:31,623 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.733333333333333) internal successors, (101), 16 states have internal predecessors, (101), 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-12-02 15:45:31,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:45:31,625 INFO L225 Difference]: With dead ends: 621 [2024-12-02 15:45:31,625 INFO L226 Difference]: Without dead ends: 621 [2024-12-02 15:45:31,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2024-12-02 15:45:31,625 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 503 mSDsluCounter, 2486 mSDsCounter, 0 mSdLazyCounter, 2153 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 2809 SdHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-12-02 15:45:31,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 2809 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2153 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-12-02 15:45:31,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-12-02 15:45:31,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 617. [2024-12-02 15:45:31,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 452 states have (on average 1.5221238938053097) internal successors, (688), 610 states have internal predecessors, (688), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 15:45:31,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 695 transitions. [2024-12-02 15:45:31,632 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 695 transitions. Word has length 103 [2024-12-02 15:45:31,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:45:31,632 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 695 transitions. [2024-12-02 15:45:31,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.733333333333333) internal successors, (101), 16 states have internal predecessors, (101), 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-12-02 15:45:31,632 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 695 transitions. [2024-12-02 15:45:31,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-02 15:45:31,633 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:45:31,633 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-12-02 15:45:31,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-12-02 15:45:31,633 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:45:31,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:45:31,634 INFO L85 PathProgramCache]: Analyzing trace with hash -679205280, now seen corresponding path program 1 times [2024-12-02 15:45:31,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:45:31,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819795390] [2024-12-02 15:45:31,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:45:31,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:45:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:45:32,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:45:32,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:45:32,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819795390] [2024-12-02 15:45:32,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819795390] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:45:32,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:45:32,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-12-02 15:45:32,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613797041] [2024-12-02 15:45:32,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:45:32,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-12-02 15:45:32,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:45:32,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-12-02 15:45:32,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-12-02 15:45:32,525 INFO L87 Difference]: Start difference. First operand 617 states and 695 transitions. Second operand has 18 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 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-12-02 15:45:34,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:45:34,113 INFO L93 Difference]: Finished difference Result 620 states and 699 transitions. [2024-12-02 15:45:34,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 15:45:34,114 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 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-12-02 15:45:34,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:45:34,115 INFO L225 Difference]: With dead ends: 620 [2024-12-02 15:45:34,115 INFO L226 Difference]: Without dead ends: 620 [2024-12-02 15:45:34,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-12-02 15:45:34,115 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 481 mSDsluCounter, 2316 mSDsCounter, 0 mSdLazyCounter, 2859 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 2640 SdHoareTripleChecker+Invalid, 2875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-12-02 15:45:34,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 2640 Invalid, 2875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2859 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-12-02 15:45:34,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-12-02 15:45:34,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 617. [2024-12-02 15:45:34,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 452 states have (on average 1.5199115044247788) internal successors, (687), 610 states have internal predecessors, (687), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 15:45:34,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 694 transitions. [2024-12-02 15:45:34,120 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 694 transitions. Word has length 103 [2024-12-02 15:45:34,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:45:34,120 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 694 transitions. [2024-12-02 15:45:34,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 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-12-02 15:45:34,121 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 694 transitions. [2024-12-02 15:45:34,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-02 15:45:34,121 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:45:34,121 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] [2024-12-02 15:45:34,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-12-02 15:45:34,121 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:45:34,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:45:34,122 INFO L85 PathProgramCache]: Analyzing trace with hash 910322804, now seen corresponding path program 1 times [2024-12-02 15:45:34,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:45:34,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993939462] [2024-12-02 15:45:34,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:45:34,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:45:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:45:34,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:45:34,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:45:34,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993939462] [2024-12-02 15:45:34,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993939462] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:45:34,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305965350] [2024-12-02 15:45:34,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:45:34,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:45:34,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:45:34,746 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:45:34,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 15:45:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:45:34,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-12-02 15:45:34,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:45:35,045 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 15:45:35,045 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-12-02 15:45:35,060 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-12-02 15:45:35,117 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:35,118 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-12-02 15:45:35,155 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:35,155 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-12-02 15:45:35,191 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:35,191 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-12-02 15:45:35,225 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:35,226 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-12-02 15:45:35,262 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:35,262 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-12-02 15:45:35,271 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-12-02 15:45:35,286 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 15:45:35,286 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-12-02 15:45:35,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:45:35,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:45:35,891 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-12-02 15:45:35,892 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-12-02 15:45:35,903 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2254 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2260 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#1.base| (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~mem51#1.base| v_ArrVal_2260))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2253)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2254)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2255)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2256)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-12-02 15:45:35,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305965350] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:45:35,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 15:45:35,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 23 [2024-12-02 15:45:35,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874331422] [2024-12-02 15:45:35,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 15:45:35,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-12-02 15:45:35,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:45:35,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-12-02 15:45:35,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=915, Unknown=48, NotChecked=64, Total=1190 [2024-12-02 15:45:35,906 INFO L87 Difference]: Start difference. First operand 617 states and 694 transitions. Second operand has 24 states, 21 states have (on average 6.238095238095238) internal successors, (131), 23 states have internal predecessors, (131), 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-12-02 15:45:37,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:45:37,491 INFO L93 Difference]: Finished difference Result 619 states and 698 transitions. [2024-12-02 15:45:37,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 15:45:37,491 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 6.238095238095238) internal successors, (131), 23 states have internal predecessors, (131), 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 104 [2024-12-02 15:45:37,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:45:37,493 INFO L225 Difference]: With dead ends: 619 [2024-12-02 15:45:37,493 INFO L226 Difference]: Without dead ends: 619 [2024-12-02 15:45:37,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=267, Invalid=1411, Unknown=48, NotChecked=80, Total=1806 [2024-12-02 15:45:37,493 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 468 mSDsluCounter, 3679 mSDsCounter, 0 mSdLazyCounter, 3092 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 4001 SdHoareTripleChecker+Invalid, 3111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-12-02 15:45:37,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 4001 Invalid, 3111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3092 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-12-02 15:45:37,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-12-02 15:45:37,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 616. [2024-12-02 15:45:37,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 452 states have (on average 1.5176991150442478) internal successors, (686), 609 states have internal predecessors, (686), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 15:45:37,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 693 transitions. [2024-12-02 15:45:37,499 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 693 transitions. Word has length 104 [2024-12-02 15:45:37,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:45:37,499 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 693 transitions. [2024-12-02 15:45:37,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 6.238095238095238) internal successors, (131), 23 states have internal predecessors, (131), 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-12-02 15:45:37,499 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 693 transitions. [2024-12-02 15:45:37,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-02 15:45:37,500 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:45:37,500 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] [2024-12-02 15:45:37,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-02 15:45:37,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:45:37,700 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:45:37,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:45:37,700 INFO L85 PathProgramCache]: Analyzing trace with hash 910322805, now seen corresponding path program 1 times [2024-12-02 15:45:37,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:45:37,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075566006] [2024-12-02 15:45:37,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:45:37,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:45:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:45:38,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:45:38,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:45:38,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075566006] [2024-12-02 15:45:38,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075566006] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:45:38,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726061846] [2024-12-02 15:45:38,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:45:38,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:45:38,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:45:38,740 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:45:38,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 15:45:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:45:38,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-12-02 15:45:38,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:45:39,075 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 15:45:39,075 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-12-02 15:45:39,079 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-12-02 15:45:39,100 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-12-02 15:45:39,104 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-12-02 15:45:39,170 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-12-02 15:45:39,173 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-12-02 15:45:39,299 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:39,300 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-12-02 15:45:39,305 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-12-02 15:45:39,410 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:39,410 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-12-02 15:45:39,415 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-12-02 15:45:39,506 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:39,506 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-12-02 15:45:39,510 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-12-02 15:45:39,603 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:39,603 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-12-02 15:45:39,607 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-12-02 15:45:39,704 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:45:39,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-12-02 15:45:39,708 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-12-02 15:45:39,733 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-12-02 15:45:39,739 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-12-02 15:45:39,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 15:45:39,789 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-12-02 15:45:39,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-12-02 15:45:39,799 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 15:45:39,799 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-12-02 15:45:39,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:45:39,824 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:45:55,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 15:45:55,672 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-12-02 15:45:56,108 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_21 Int)) (or (= |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_21) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_ArrVal_2443 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_ArrVal_2442 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_22))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_prenex_25))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_prenex_23))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_prenex_27))) (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~mem51#1.base| v_prenex_19) .cse0 v_prenex_24) .cse1 v_prenex_20) .cse2 v_prenex_18) .cse3 v_prenex_26) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| v_prenex_21 v_ArrVal_2443) (select (select (store .cse5 .cse3 v_ArrVal_2442) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))) (forall ((v_ArrVal_2439 (Array Int Int)) (v_ArrVal_2449 (Array Int Int)) (v_ArrVal_2438 (Array Int Int)) (v_ArrVal_2448 (Array Int Int)) (v_ArrVal_2437 (Array Int Int)) (v_ArrVal_2436 (Array Int Int)) (v_ArrVal_2435 (Array Int Int)) (v_ArrVal_2441 (Array Int Int)) (v_ArrVal_2440 (Array Int Int))) (< 0 (+ (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2448))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_2435))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_2437))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2449) .cse9 v_ArrVal_2436) .cse10 v_ArrVal_2438) .cse11 v_ArrVal_2439) (select (select (store .cse12 .cse11 v_ArrVal_2440) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2441))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))))) is different from false [2024-12-02 15:45:56,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726061846] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:45:56,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 15:45:56,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 32 [2024-12-02 15:45:56,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95335055] [2024-12-02 15:45:56,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 15:45:56,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-12-02 15:45:56,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:45:56,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-12-02 15:45:56,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1653, Unknown=53, NotChecked=84, Total=1980 [2024-12-02 15:45:56,117 INFO L87 Difference]: Start difference. First operand 616 states and 693 transitions. Second operand has 33 states, 30 states have (on average 6.7) internal successors, (201), 32 states have internal predecessors, (201), 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-12-02 15:46:19,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:46:19,742 INFO L93 Difference]: Finished difference Result 618 states and 697 transitions. [2024-12-02 15:46:19,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-12-02 15:46:19,742 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 6.7) internal successors, (201), 32 states have internal predecessors, (201), 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 104 [2024-12-02 15:46:19,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:46:19,744 INFO L225 Difference]: With dead ends: 618 [2024-12-02 15:46:19,744 INFO L226 Difference]: Without dead ends: 618 [2024-12-02 15:46:19,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=346, Invalid=2467, Unknown=53, NotChecked=104, Total=2970 [2024-12-02 15:46:19,745 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 903 mSDsluCounter, 3884 mSDsCounter, 0 mSdLazyCounter, 5559 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 4131 SdHoareTripleChecker+Invalid, 5594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 5559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.7s IncrementalHoareTripleChecker+Time [2024-12-02 15:46:19,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 4131 Invalid, 5594 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [35 Valid, 5559 Invalid, 0 Unknown, 0 Unchecked, 21.7s Time] [2024-12-02 15:46:19,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-12-02 15:46:19,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 596. [2024-12-02 15:46:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 434 states have (on average 1.5345622119815667) internal successors, (666), 590 states have internal predecessors, (666), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 15:46:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 672 transitions. [2024-12-02 15:46:19,750 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 672 transitions. Word has length 104 [2024-12-02 15:46:19,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:46:19,751 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 672 transitions. [2024-12-02 15:46:19,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 6.7) internal successors, (201), 32 states have internal predecessors, (201), 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-12-02 15:46:19,751 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 672 transitions. [2024-12-02 15:46:19,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-12-02 15:46:19,752 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:46:19,752 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-12-02 15:46:19,761 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-12-02 15:46:19,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:46:19,952 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:46:19,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:46:19,953 INFO L85 PathProgramCache]: Analyzing trace with hash -612948337, now seen corresponding path program 1 times [2024-12-02 15:46:19,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:46:19,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480643157] [2024-12-02 15:46:19,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:46:19,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:46:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:46:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:46:21,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:46:21,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480643157] [2024-12-02 15:46:21,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480643157] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:46:21,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:46:21,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-12-02 15:46:21,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400468594] [2024-12-02 15:46:21,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:46:21,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-12-02 15:46:21,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:46:21,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-12-02 15:46:21,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-12-02 15:46:21,150 INFO L87 Difference]: Start difference. First operand 596 states and 672 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-12-02 15:46:33,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:46:33,023 INFO L93 Difference]: Finished difference Result 622 states and 701 transitions. [2024-12-02 15:46:33,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 15:46:33,024 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-12-02 15:46:33,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:46:33,025 INFO L225 Difference]: With dead ends: 622 [2024-12-02 15:46:33,025 INFO L226 Difference]: Without dead ends: 622 [2024-12-02 15:46:33,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2024-12-02 15:46:33,026 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 503 mSDsluCounter, 3669 mSDsCounter, 0 mSdLazyCounter, 3007 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 3994 SdHoareTripleChecker+Invalid, 3020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2024-12-02 15:46:33,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 3994 Invalid, 3020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3007 Invalid, 0 Unknown, 0 Unchecked, 11.2s Time] [2024-12-02 15:46:33,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-12-02 15:46:33,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 618. [2024-12-02 15:46:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 455 states have (on average 1.5142857142857142) internal successors, (689), 611 states have internal predecessors, (689), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 15:46:33,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 696 transitions. [2024-12-02 15:46:33,031 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 696 transitions. Word has length 106 [2024-12-02 15:46:33,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:46:33,031 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 696 transitions. [2024-12-02 15:46:33,031 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-12-02 15:46:33,031 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 696 transitions. [2024-12-02 15:46:33,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-12-02 15:46:33,032 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:46:33,032 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-12-02 15:46:33,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-12-02 15:46:33,032 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:46:33,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:46:33,032 INFO L85 PathProgramCache]: Analyzing trace with hash -612948336, now seen corresponding path program 1 times [2024-12-02 15:46:33,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:46:33,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708888185] [2024-12-02 15:46:33,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:46:33,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:46:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:46:35,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:46:35,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:46:35,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708888185] [2024-12-02 15:46:35,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708888185] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:46:35,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:46:35,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-12-02 15:46:35,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000478492] [2024-12-02 15:46:35,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:46:35,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-12-02 15:46:35,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:46:35,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-12-02 15:46:35,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-12-02 15:46:35,549 INFO L87 Difference]: Start difference. First operand 618 states and 696 transitions. Second operand has 19 states, 17 states have (on average 6.117647058823529) internal successors, (104), 18 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-12-02 15:46:47,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:46:47,077 INFO L93 Difference]: Finished difference Result 621 states and 700 transitions. [2024-12-02 15:46:47,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-02 15:46:47,078 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.117647058823529) internal successors, (104), 18 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-12-02 15:46:47,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:46:47,080 INFO L225 Difference]: With dead ends: 621 [2024-12-02 15:46:47,080 INFO L226 Difference]: Without dead ends: 621 [2024-12-02 15:46:47,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-12-02 15:46:47,081 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 502 mSDsluCounter, 2393 mSDsCounter, 0 mSdLazyCounter, 2768 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 2716 SdHoareTripleChecker+Invalid, 2784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-12-02 15:46:47,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 2716 Invalid, 2784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2768 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2024-12-02 15:46:47,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-12-02 15:46:47,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 618. [2024-12-02 15:46:47,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 455 states have (on average 1.512087912087912) internal successors, (688), 611 states have internal predecessors, (688), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 15:46:47,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 695 transitions. [2024-12-02 15:46:47,086 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 695 transitions. Word has length 106 [2024-12-02 15:46:47,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:46:47,086 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 695 transitions. [2024-12-02 15:46:47,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.117647058823529) internal successors, (104), 18 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-12-02 15:46:47,087 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 695 transitions. [2024-12-02 15:46:47,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-02 15:46:47,087 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:46:47,087 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] [2024-12-02 15:46:47,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-12-02 15:46:47,087 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:46:47,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:46:47,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1003793498, now seen corresponding path program 1 times [2024-12-02 15:46:47,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:46:47,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067490499] [2024-12-02 15:46:47,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:46:47,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:46:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:46:47,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 15:46:47,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:46:47,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067490499] [2024-12-02 15:46:47,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067490499] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:46:47,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:46:47,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:46:47,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707316927] [2024-12-02 15:46:47,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:46:47,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:46:47,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:46:47,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:46:47,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:46:47,747 INFO L87 Difference]: Start difference. First operand 618 states and 695 transitions. Second operand has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 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-12-02 15:46:50,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:46:50,088 INFO L93 Difference]: Finished difference Result 617 states and 694 transitions. [2024-12-02 15:46:50,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:46:50,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 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 107 [2024-12-02 15:46:50,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:46:50,091 INFO L225 Difference]: With dead ends: 617 [2024-12-02 15:46:50,091 INFO L226 Difference]: Without dead ends: 617 [2024-12-02 15:46:50,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-12-02 15:46:50,091 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 2 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-12-02 15:46:50,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1591 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-12-02 15:46:50,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-12-02 15:46:50,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2024-12-02 15:46:50,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 455 states have (on average 1.5098901098901099) internal successors, (687), 610 states have internal predecessors, (687), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 15:46:50,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 694 transitions. [2024-12-02 15:46:50,097 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 694 transitions. Word has length 107 [2024-12-02 15:46:50,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:46:50,097 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 694 transitions. [2024-12-02 15:46:50,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 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-12-02 15:46:50,097 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 694 transitions. [2024-12-02 15:46:50,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-02 15:46:50,098 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:46:50,098 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] [2024-12-02 15:46:50,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-12-02 15:46:50,098 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:46:50,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:46:50,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1003793499, now seen corresponding path program 1 times [2024-12-02 15:46:50,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:46:50,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098466656] [2024-12-02 15:46:50,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:46:50,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:46:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:46:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:46:52,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:46:52,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098466656] [2024-12-02 15:46:52,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098466656] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:46:52,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468287207] [2024-12-02 15:46:52,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:46:52,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:46:52,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:46:52,798 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:46:52,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-02 15:46:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:46:53,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-12-02 15:46:53,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:46:53,523 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-12-02 15:46:53,560 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 15:46:53,561 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-12-02 15:46:53,713 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-12-02 15:46:53,732 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-12-02 15:46:54,144 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-12-02 15:46:54,155 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-12-02 15:46:54,644 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:46:54,644 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-12-02 15:46:54,656 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-12-02 15:46:55,050 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:46:55,051 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-12-02 15:46:55,061 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-12-02 15:46:55,425 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:46:55,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-12-02 15:46:55,437 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-12-02 15:46:55,796 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:46:55,796 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-12-02 15:46:55,830 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-12-02 15:46:56,164 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:46:56,165 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-12-02 15:46:56,176 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-12-02 15:46:56,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 15:46:56,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-12-02 15:46:56,451 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 15:46:56,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 15:46:56,523 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:46:56,523 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-12-02 15:46:56,533 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-12-02 15:46:56,594 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-12-02 15:46:56,611 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-12-02 15:46:56,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:46:56,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:46:56,928 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2904 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 44) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2903 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 40))))) is different from false [2024-12-02 15:46:57,605 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_9|) 0)) (forall ((v_ArrVal_2902 Int) (v_ArrVal_2904 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2901))) (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~mem56#1.base| v_ArrVal_2900) .cse0 v_ArrVal_2903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_9| v_ArrVal_2902) (select (select (store .cse2 .cse0 v_ArrVal_2904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_9|) 0))) (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2900) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2901) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 40)))))) is different from false [2024-12-02 15:46:59,114 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2896))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2898))) (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_2897) .cse0 v_ArrVal_2899) .cse1 v_ArrVal_2900) (select (select (store .cse2 .cse1 v_ArrVal_2901) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2903))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_9|) 0)))) (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_9|) 0)) (forall ((v_ArrVal_2902 Int) (v_ArrVal_2904 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2896))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2898))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2901))) (let ((.cse7 (select (select .cse8 |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~mem54#1.base| v_ArrVal_2897) .cse5 v_ArrVal_2899) .cse6 v_ArrVal_2900) .cse7 v_ArrVal_2903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_9| v_ArrVal_2902) (select (select (store .cse8 .cse7 v_ArrVal_2904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-12-02 15:47:06,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 15:47:06,230 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-12-02 15:47:06,623 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (or (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2895 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2904 (Array Int Int)) (v_ArrVal_2902 Int) (v_ArrVal_2903 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2895))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_2896))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2898))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_2901))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 43 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2894) .cse0 v_ArrVal_2897) .cse1 v_ArrVal_2899) .cse2 v_ArrVal_2900) .cse3 v_ArrVal_2903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_9| v_ArrVal_2902) (select (select (store .cse5 .cse3 v_ArrVal_2904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_9| |c_ULTIMATE.start_main_#t~mem53#1.base|))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_37 (Array Int Int))) (< 0 (+ 41 (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_prenex_34))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_prenex_33))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_prenex_31))) (let ((.cse11 (select (select .cse12 |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_prenex_35) .cse9 v_prenex_32) .cse10 v_prenex_30) .cse11 v_prenex_29) (select (select (store .cse12 .cse11 v_prenex_28) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_37))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))) is different from false [2024-12-02 15:47:10,853 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_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_9| .cse0) (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2895 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2904 (Array Int Int)) (v_ArrVal_2902 Int) (v_ArrVal_2903 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2895))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_2896))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_2898))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_2901))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2894) .cse1 v_ArrVal_2897) .cse2 v_ArrVal_2899) .cse3 v_ArrVal_2900) .cse4 v_ArrVal_2903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_9| v_ArrVal_2902) (select (select (store .cse6 .cse4 v_ArrVal_2904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_37 (Array Int Int))) (< 0 (+ (select (select (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_34))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse10 v_prenex_33))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse11 v_prenex_31))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_35) .cse10 v_prenex_32) .cse11 v_prenex_30) .cse12 v_prenex_29) (select (select (store .cse13 .cse12 v_prenex_28) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_37))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 41)))))) is different from false [2024-12-02 15:47:15,319 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2910 (Array Int Int)) (v_ArrVal_2909 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_9| Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2909))) (let ((.cse0 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (or (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2895 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2904 (Array Int Int)) (v_ArrVal_2902 Int) (v_ArrVal_2903 (Array Int Int))) (let ((.cse9 (store .cse10 .cse0 v_ArrVal_2895))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_2896))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_2898))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_2901))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< (+ (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2910) .cse0 v_ArrVal_2894) .cse1 v_ArrVal_2897) .cse2 v_ArrVal_2899) .cse3 v_ArrVal_2900) .cse4 v_ArrVal_2903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_9| v_ArrVal_2902) (select (select (store .cse6 .cse4 v_ArrVal_2904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_9| .cse0))))) (forall ((v_ArrVal_2910 (Array Int Int)) (v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_ArrVal_2909 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_37 (Array Int Int))) (< 0 (+ 41 (select (select (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2909))) (let ((.cse11 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse11 v_prenex_34))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse12 v_prenex_33))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse13 v_prenex_31))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2910) .cse11 v_prenex_35) .cse12 v_prenex_32) .cse13 v_prenex_30) .cse14 v_prenex_29) (select (select (store .cse15 .cse14 v_prenex_28) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_37))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))) is different from false [2024-12-02 15:47:15,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468287207] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:47:15,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 15:47:15,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 28 [2024-12-02 15:47:15,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869205534] [2024-12-02 15:47:15,353 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 15:47:15,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-12-02 15:47:15,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:47:15,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-12-02 15:47:15,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1121, Unknown=39, NotChecked=450, Total=1806 [2024-12-02 15:47:15,354 INFO L87 Difference]: Start difference. First operand 617 states and 694 transitions. Second operand has 29 states, 26 states have (on average 5.423076923076923) internal successors, (141), 28 states have internal predecessors, (141), 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-12-02 15:47:35,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:47:35,909 INFO L93 Difference]: Finished difference Result 619 states and 698 transitions. [2024-12-02 15:47:35,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-12-02 15:47:35,910 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 5.423076923076923) internal successors, (141), 28 states have internal predecessors, (141), 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 107 [2024-12-02 15:47:35,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:47:35,912 INFO L225 Difference]: With dead ends: 619 [2024-12-02 15:47:35,912 INFO L226 Difference]: Without dead ends: 619 [2024-12-02 15:47:35,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=358, Invalid=2077, Unknown=39, NotChecked=606, Total=3080 [2024-12-02 15:47:35,913 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 490 mSDsluCounter, 2654 mSDsCounter, 0 mSdLazyCounter, 3070 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 2974 SdHoareTripleChecker+Invalid, 3091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.1s IncrementalHoareTripleChecker+Time [2024-12-02 15:47:35,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 2974 Invalid, 3091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3070 Invalid, 0 Unknown, 0 Unchecked, 18.1s Time] [2024-12-02 15:47:35,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-12-02 15:47:35,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 594. [2024-12-02 15:47:35,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 434 states have (on average 1.5299539170506913) internal successors, (664), 588 states have internal predecessors, (664), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 15:47:35,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 670 transitions. [2024-12-02 15:47:35,920 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 670 transitions. Word has length 107 [2024-12-02 15:47:35,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:47:35,920 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 670 transitions. [2024-12-02 15:47:35,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 5.423076923076923) internal successors, (141), 28 states have internal predecessors, (141), 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-12-02 15:47:35,920 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 670 transitions. [2024-12-02 15:47:35,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-02 15:47:35,921 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:47:35,921 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-12-02 15:47:35,929 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-12-02 15:47:36,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-12-02 15:47:36,121 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:47:36,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:47:36,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1857688454, now seen corresponding path program 1 times [2024-12-02 15:47:36,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:47:36,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374484752] [2024-12-02 15:47:36,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:47:36,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:47:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:47:38,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:47:38,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:47:38,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374484752] [2024-12-02 15:47:38,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374484752] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:47:38,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:47:38,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-12-02 15:47:38,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628543752] [2024-12-02 15:47:38,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:47:38,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-12-02 15:47:38,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:47:38,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-12-02 15:47:38,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-12-02 15:47:38,185 INFO L87 Difference]: Start difference. First operand 594 states and 670 transitions. Second operand has 17 states, 16 states have (on average 6.6875) internal successors, (107), 17 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-12-02 15:47:53,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:47:53,553 INFO L93 Difference]: Finished difference Result 645 states and 726 transitions. [2024-12-02 15:47:53,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 15:47:53,554 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.6875) internal successors, (107), 17 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-12-02 15:47:53,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:47:53,555 INFO L225 Difference]: With dead ends: 645 [2024-12-02 15:47:53,556 INFO L226 Difference]: Without dead ends: 645 [2024-12-02 15:47:53,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2024-12-02 15:47:53,556 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 513 mSDsluCounter, 2863 mSDsCounter, 0 mSdLazyCounter, 2538 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 3194 SdHoareTripleChecker+Invalid, 2553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2024-12-02 15:47:53,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 3194 Invalid, 2553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2538 Invalid, 0 Unknown, 0 Unchecked, 14.2s Time] [2024-12-02 15:47:53,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-12-02 15:47:53,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 619. [2024-12-02 15:47:53,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 458 states have (on average 1.5065502183406114) internal successors, (690), 612 states have internal predecessors, (690), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 15:47:53,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 697 transitions. [2024-12-02 15:47:53,561 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 697 transitions. Word has length 109 [2024-12-02 15:47:53,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:47:53,562 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 697 transitions. [2024-12-02 15:47:53,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.6875) internal successors, (107), 17 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-12-02 15:47:53,562 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 697 transitions. [2024-12-02 15:47:53,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-02 15:47:53,562 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:47:53,562 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-12-02 15:47:53,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-12-02 15:47:53,562 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:47:53,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:47:53,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1857688455, now seen corresponding path program 1 times [2024-12-02 15:47:53,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:47:53,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484442651] [2024-12-02 15:47:53,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:47:53,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:47:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:47:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:47:56,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:47:56,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484442651] [2024-12-02 15:47:56,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484442651] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:47:56,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:47:56,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-12-02 15:47:56,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575789017] [2024-12-02 15:47:56,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:47:56,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-12-02 15:47:56,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:47:56,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-12-02 15:47:56,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-12-02 15:47:56,078 INFO L87 Difference]: Start difference. First operand 619 states and 697 transitions. Second operand has 16 states, 15 states have (on average 7.133333333333334) internal successors, (107), 16 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-12-02 15:48:11,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:48:11,567 INFO L93 Difference]: Finished difference Result 644 states and 725 transitions. [2024-12-02 15:48:11,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 15:48:11,568 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 7.133333333333334) internal successors, (107), 16 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-12-02 15:48:11,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:48:11,570 INFO L225 Difference]: With dead ends: 644 [2024-12-02 15:48:11,570 INFO L226 Difference]: Without dead ends: 644 [2024-12-02 15:48:11,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2024-12-02 15:48:11,570 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 532 mSDsluCounter, 2374 mSDsCounter, 0 mSdLazyCounter, 2483 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 2701 SdHoareTripleChecker+Invalid, 2499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2024-12-02 15:48:11,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 2701 Invalid, 2499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2483 Invalid, 0 Unknown, 0 Unchecked, 14.3s Time] [2024-12-02 15:48:11,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-12-02 15:48:11,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 619. [2024-12-02 15:48:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 458 states have (on average 1.5043668122270741) internal successors, (689), 612 states have internal predecessors, (689), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 15:48:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 696 transitions. [2024-12-02 15:48:11,577 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 696 transitions. Word has length 109 [2024-12-02 15:48:11,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:48:11,577 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 696 transitions. [2024-12-02 15:48:11,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 7.133333333333334) internal successors, (107), 16 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-12-02 15:48:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 696 transitions. [2024-12-02 15:48:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-02 15:48:11,578 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:48:11,578 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-12-02 15:48:11,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-12-02 15:48:11,578 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:48:11,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:48:11,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1844529701, now seen corresponding path program 1 times [2024-12-02 15:48:11,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:48:11,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712239423] [2024-12-02 15:48:11,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:48:11,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:48:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:48:14,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:48:14,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:48:14,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712239423] [2024-12-02 15:48:14,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712239423] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:48:14,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981815014] [2024-12-02 15:48:14,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:48:14,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:48:14,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:48:14,266 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:48:14,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-02 15:48:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:48:14,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-12-02 15:48:14,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:48:15,423 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 15:48:15,423 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-12-02 15:48:15,452 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-12-02 15:48:15,774 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:48:15,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 15:48:16,121 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:48:16,121 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-12-02 15:48:16,422 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:48:16,422 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-12-02 15:48:16,740 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:48:16,740 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-12-02 15:48:17,058 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:48:17,058 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-12-02 15:48:17,334 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:48:17,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-12-02 15:48:17,669 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:48:17,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 15:48:17,728 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-12-02 15:48:17,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:48:17,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:48:17,828 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-12-02 15:48:17,828 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-12-02 15:48:17,849 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3291 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem59#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3291) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2024-12-02 15:48:18,327 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3289 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3289) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-12-02 15:48:18,435 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3288 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3288) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-12-02 15:48:18,543 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3287 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3287) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-12-02 15:48:18,664 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3286 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3286) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-12-02 15:48:19,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981815014] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:48:19,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 15:48:19,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 23 [2024-12-02 15:48:19,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250108191] [2024-12-02 15:48:19,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 15:48:19,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-12-02 15:48:19,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:48:19,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-12-02 15:48:19,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=576, Unknown=12, NotChecked=260, Total=930 [2024-12-02 15:48:19,196 INFO L87 Difference]: Start difference. First operand 619 states and 696 transitions. Second operand has 24 states, 22 states have (on average 6.136363636363637) internal successors, (135), 24 states have internal predecessors, (135), 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-12-02 15:48:47,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:48:47,484 INFO L93 Difference]: Finished difference Result 635 states and 714 transitions. [2024-12-02 15:48:47,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-02 15:48:47,485 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 6.136363636363637) internal successors, (135), 24 states have internal predecessors, (135), 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 110 [2024-12-02 15:48:47,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:48:47,487 INFO L225 Difference]: With dead ends: 635 [2024-12-02 15:48:47,487 INFO L226 Difference]: Without dead ends: 635 [2024-12-02 15:48:47,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 118 SyntacticMatches, 8 SemanticMatches, 40 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=170, Invalid=1169, Unknown=13, NotChecked=370, Total=1722 [2024-12-02 15:48:47,488 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 506 mSDsluCounter, 5205 mSDsCounter, 0 mSdLazyCounter, 4159 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 5528 SdHoareTripleChecker+Invalid, 4181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.5s IncrementalHoareTripleChecker+Time [2024-12-02 15:48:47,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 5528 Invalid, 4181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 4159 Invalid, 0 Unknown, 0 Unchecked, 26.5s Time] [2024-12-02 15:48:47,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-12-02 15:48:47,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 618. [2024-12-02 15:48:47,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 458 states have (on average 1.502183406113537) internal successors, (688), 611 states have internal predecessors, (688), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-12-02 15:48:47,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 695 transitions. [2024-12-02 15:48:47,496 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 695 transitions. Word has length 110 [2024-12-02 15:48:47,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:48:47,496 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 695 transitions. [2024-12-02 15:48:47,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 6.136363636363637) internal successors, (135), 24 states have internal predecessors, (135), 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-12-02 15:48:47,496 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 695 transitions. [2024-12-02 15:48:47,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-02 15:48:47,496 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:48:47,496 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-12-02 15:48:47,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-12-02 15:48:47,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-12-02 15:48:47,697 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:48:47,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:48:47,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1844529700, now seen corresponding path program 1 times [2024-12-02 15:48:47,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:48:47,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310549235] [2024-12-02 15:48:47,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:48:47,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:48:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:48:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:48:50,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:48:50,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310549235] [2024-12-02 15:48:50,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310549235] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:48:50,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230156008] [2024-12-02 15:48:50,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:48:50,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:48:50,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:48:50,969 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:48:50,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-12-02 15:48:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:48:51,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-12-02 15:48:51,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:48:52,101 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 15:48:52,101 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-12-02 15:48:52,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 15:48:52,332 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-12-02 15:48:53,045 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:48:53,045 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-12-02 15:48:53,059 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-12-02 15:48:53,445 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:48:53,446 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-12-02 15:48:53,460 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-12-02 15:48:53,842 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:48:53,842 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-12-02 15:48:53,857 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-12-02 15:48:54,258 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:48:54,258 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-12-02 15:48:54,273 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-12-02 15:48:54,703 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:48:54,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 15:48:54,718 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-12-02 15:48:55,208 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:48:55,208 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 70 treesize of output 65 [2024-12-02 15:48:55,222 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 49 treesize of output 30 [2024-12-02 15:48:56,016 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:48:56,016 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 70 treesize of output 65 [2024-12-02 15:48:56,032 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 49 treesize of output 30 [2024-12-02 15:48:56,130 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 39 treesize of output 21 [2024-12-02 15:48:56,144 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 32 treesize of output 14 [2024-12-02 15:48:56,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:48:56,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:48:56,764 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3502 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3503) |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~mem59#1.base| v_ArrVal_3502) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3503) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2024-12-02 15:48:56,813 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_3502 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3503) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3502) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3503) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-12-02 15:48:56,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 15:48:56,912 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 82 treesize of output 86 [2024-12-02 15:48:57,112 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_prenex_40))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~mem57#1.base|)) (forall ((v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3501) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3503) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_prenex_41) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ |c_ULTIMATE.start_main_#t~mem57#1.offset| 1))))) is different from false [2024-12-02 15:48:57,232 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_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_41) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_42) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 1))) (forall ((v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (= .cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_prenex_40))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3501) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3503) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-12-02 15:48:57,349 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_42 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3498))) (< (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3499))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store .cse0 .cse1 v_prenex_41) (select (select (store .cse2 .cse1 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_42))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3499))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3498) .cse4 v_ArrVal_3501) (select (select (store .cse5 .cse4 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3503))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3499))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (let ((.cse6 (store .cse7 .cse8 v_prenex_40))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse8)))))) is different from false [2024-12-02 15:48:57,561 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |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|) .cse3))) (and (forall ((v_prenex_42 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_3498))) (< (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3499))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store .cse0 .cse1 v_prenex_41) (select (select (store .cse2 .cse1 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_42))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3499))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_3498) .cse5 v_ArrVal_3501) (select (select (store .cse6 .cse5 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3503))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3499))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (let ((.cse7 (store .cse8 .cse9 v_prenex_40))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse9))))))) is different from false [2024-12-02 15:48:57,744 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3496))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3497) .cse5 v_ArrVal_3498))) (< (select (select (let ((.cse2 (store .cse4 .cse5 v_ArrVal_3499))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store .cse0 .cse1 v_prenex_41) (select (select (store .cse2 .cse1 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_42))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))))) (forall ((v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3496))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3499))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3497) .cse6 v_ArrVal_3498) .cse7 v_ArrVal_3501) (select (select (store .cse8 .cse7 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3503))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (forall ((v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_3496))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3499)))) (let ((.cse10 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= .cse10 (select (select (let ((.cse11 (store .cse12 .cse10 v_prenex_40))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2024-12-02 15:48:57,873 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |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|) .cse2))) (and (forall ((v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3496))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3499)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_prenex_40))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3496))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_3497) .cse10 v_ArrVal_3498))) (< (select (select (let ((.cse8 (store .cse9 .cse10 v_ArrVal_3499))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store .cse6 .cse7 v_prenex_41) (select (select (store .cse8 .cse7 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_42))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)))))) (forall ((v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_3496))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_3499))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_3497) .cse11 v_ArrVal_3498) .cse12 v_ArrVal_3501) (select (select (store .cse13 .cse12 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3503))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-12-02 15:48:58,067 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3495))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_3496))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3494) .cse6 v_ArrVal_3497) .cse5 v_ArrVal_3498))) (< (select (select (let ((.cse2 (store .cse4 .cse5 v_ArrVal_3499))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store .cse0 .cse1 v_prenex_41) (select (select (store .cse2 .cse1 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_42))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))))))) (forall ((v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (let ((.cse10 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3495))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3496)))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3499)))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= .cse8 (select (select (let ((.cse9 (store .cse10 .cse8 v_prenex_40))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) (forall ((v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3495))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_3496))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_3499))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3494) .cse13 v_ArrVal_3497) .cse14 v_ArrVal_3498) .cse15 v_ArrVal_3501) (select (select (store .cse16 .cse15 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3503))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) is different from false [2024-12-02 15:48:58,341 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_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3495))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3496))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3499))) (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_3494) .cse1 v_ArrVal_3497) .cse2 v_ArrVal_3498) .cse3 v_ArrVal_3501) (select (select (store .cse4 .cse3 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3503))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (forall ((v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (let ((.cse10 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3495))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3496)))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3499)))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (= .cse8 (select (select (let ((.cse9 (store .cse10 .cse8 v_prenex_40))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))) (forall ((v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3495))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse19 .cse18 v_ArrVal_3496))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3494) .cse18 v_ArrVal_3497) .cse17 v_ArrVal_3498))) (< (select (select (let ((.cse15 (store .cse16 .cse17 v_ArrVal_3499))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store .cse13 .cse14 v_prenex_41) (select (select (store .cse15 .cse14 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_42))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (+ (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 1))))))))))) is different from false [2024-12-02 15:49:02,483 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3492 (Array Int Int)) (v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3493))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_3495))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3496))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3499))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3492) .cse0 v_ArrVal_3494) .cse1 v_ArrVal_3497) .cse2 v_ArrVal_3498) .cse3 v_ArrVal_3501) (select (select (store .cse4 .cse3 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3503))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (forall ((v_ArrVal_3492 (Array Int Int)) (v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3493))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_3495))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse16 .cse15 v_ArrVal_3496))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse9 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3492) .cse14 v_ArrVal_3494) .cse15 v_ArrVal_3497) .cse13 v_ArrVal_3498))) (< (select (select (let ((.cse11 (store .cse12 .cse13 v_ArrVal_3499))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store .cse9 .cse10 v_prenex_41) (select (select (store .cse11 .cse10 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_prenex_42))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (+ (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 1)))))))))) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (let ((.cse20 (let ((.cse21 (let ((.cse22 (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_3493))) (store .cse23 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3495)))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3496)))) (store .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3499)))) (let ((.cse18 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (= .cse18 (select (select (let ((.cse19 (store .cse20 .cse18 v_prenex_40))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))) is different from false [2024-12-02 15:49:06,577 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_3492 (Array Int Int)) (v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3493))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_3495))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_3496))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_3499))) (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_3492) .cse1 v_ArrVal_3494) .cse2 v_ArrVal_3497) .cse3 v_ArrVal_3498) .cse4 v_ArrVal_3501) (select (select (store .cse5 .cse4 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3503))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (forall ((v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (let ((.cse11 (let ((.cse13 (let ((.cse14 (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3493))) (store .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3495)))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3496)))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3499)))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (= (select (select (let ((.cse10 (store .cse11 .cse12 v_prenex_40))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) .cse12)))) (forall ((v_ArrVal_3492 (Array Int Int)) (v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3493))) (let ((.cse21 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse23 (store .cse24 .cse21 v_ArrVal_3495))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse19 (store .cse23 .cse22 v_ArrVal_3496))) (let ((.cse20 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse16 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3492) .cse21 v_ArrVal_3494) .cse22 v_ArrVal_3497) .cse20 v_ArrVal_3498))) (< (select (select (let ((.cse18 (store .cse19 .cse20 v_ArrVal_3499))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store .cse16 .cse17 v_prenex_41) (select (select (store .cse18 .cse17 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_prenex_42))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) (+ (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) 1))))))))))))) is different from false [2024-12-02 15:49:10,914 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_3508 (Array Int Int)) (v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_ArrVal_3502 (Array Int Int))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_3508))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3493)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3495)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3496)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3499)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_prenex_40))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3502)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (forall ((v_ArrVal_3508 (Array Int Int)) (v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3492 (Array Int Int)) (v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_prenex_41 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_prenex_40 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_3508))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_3493))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_3495))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse11 (store .cse16 .cse15 v_ArrVal_3496))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_3509) .cse13 v_ArrVal_3492) .cse14 v_ArrVal_3494) .cse15 v_ArrVal_3497) .cse12 v_ArrVal_3498))) (< (select (select (let ((.cse10 (store .cse11 .cse12 v_ArrVal_3499))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store .cse8 .cse9 v_prenex_41) (select (select (store .cse10 .cse9 v_prenex_40) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_42))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1)))))))))))) (forall ((v_ArrVal_3508 (Array Int Int)) (v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3492 (Array Int Int)) (v_ArrVal_3493 (Array Int Int)) (v_ArrVal_3494 (Array Int Int)) (v_ArrVal_3495 (Array Int Int)) (v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3497 (Array Int Int)) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3500 (Array Int Int)) (v_ArrVal_3501 (Array Int Int)) (v_ArrVal_3503 (Array Int Int))) (<= 0 (select (select (let ((.cse28 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_3508))) (let ((.cse19 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse27 (store .cse28 .cse19 v_ArrVal_3493))) (let ((.cse20 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse26 (store .cse27 .cse20 v_ArrVal_3495))) (let ((.cse21 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse25 (store .cse26 .cse21 v_ArrVal_3496))) (let ((.cse22 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse24 (store .cse25 .cse22 v_ArrVal_3499))) (let ((.cse23 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_3509) .cse19 v_ArrVal_3492) .cse20 v_ArrVal_3494) .cse21 v_ArrVal_3497) .cse22 v_ArrVal_3498) .cse23 v_ArrVal_3501) (select (select (store .cse24 .cse23 v_ArrVal_3500) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3503))))))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-12-02 15:49:10,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230156008] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:49:10,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 15:49:10,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2024-12-02 15:49:10,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694729976] [2024-12-02 15:49:10,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 15:49:10,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-12-02 15:49:10,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:10,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-12-02 15:49:10,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=793, Unknown=13, NotChecked=884, Total=1806 [2024-12-02 15:49:10,928 INFO L87 Difference]: Start difference. First operand 618 states and 695 transitions. Second operand has 29 states, 26 states have (on average 5.730769230769231) internal successors, (149), 29 states have internal predecessors, (149), 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-12-02 15:49:38,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:49:38,769 INFO L93 Difference]: Finished difference Result 634 states and 713 transitions. [2024-12-02 15:49:38,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-12-02 15:49:38,770 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 5.730769230769231) internal successors, (149), 29 states have internal predecessors, (149), 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-12-02 15:49:38,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:49:38,771 INFO L225 Difference]: With dead ends: 634 [2024-12-02 15:49:38,772 INFO L226 Difference]: Without dead ends: 634 [2024-12-02 15:49:38,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=228, Invalid=1533, Unknown=13, NotChecked=1196, Total=2970 [2024-12-02 15:49:38,773 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 548 mSDsluCounter, 4409 mSDsCounter, 0 mSdLazyCounter, 4173 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 4727 SdHoareTripleChecker+Invalid, 4198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.3s IncrementalHoareTripleChecker+Time [2024-12-02 15:49:38,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 4727 Invalid, 4198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 4173 Invalid, 0 Unknown, 0 Unchecked, 25.3s Time] [2024-12-02 15:49:38,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-12-02 15:49:38,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 592. [2024-12-02 15:49:38,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 434 states have (on average 1.5253456221198156) internal successors, (662), 586 states have internal predecessors, (662), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 15:49:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 668 transitions. [2024-12-02 15:49:38,779 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 668 transitions. Word has length 110 [2024-12-02 15:49:38,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:49:38,779 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 668 transitions. [2024-12-02 15:49:38,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 5.730769230769231) internal successors, (149), 29 states have internal predecessors, (149), 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-12-02 15:49:38,780 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 668 transitions. [2024-12-02 15:49:38,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-02 15:49:38,780 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:49:38,780 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, 1, 1] [2024-12-02 15:49:38,788 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-12-02 15:49:38,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2024-12-02 15:49:38,980 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:49:38,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:38,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1743797443, now seen corresponding path program 1 times [2024-12-02 15:49:38,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:38,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632116561] [2024-12-02 15:49:38,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:38,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:39,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:49:39,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:39,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632116561] [2024-12-02 15:49:39,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632116561] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:39,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:39,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 15:49:39,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530498170] [2024-12-02 15:49:39,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:39,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 15:49:39,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:39,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 15:49:39,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 15:49:39,197 INFO L87 Difference]: Start difference. First operand 592 states and 668 transitions. Second operand has 5 states, 4 states have (on average 27.5) internal successors, (110), 5 states have internal predecessors, (110), 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-12-02 15:49:42,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:49:42,785 INFO L93 Difference]: Finished difference Result 591 states and 667 transitions. [2024-12-02 15:49:42,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 15:49:42,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.5) internal successors, (110), 5 states have internal predecessors, (110), 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 112 [2024-12-02 15:49:42,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:49:42,787 INFO L225 Difference]: With dead ends: 591 [2024-12-02 15:49:42,787 INFO L226 Difference]: Without dead ends: 591 [2024-12-02 15:49:42,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:49:42,788 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 5 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-12-02 15:49:42,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1571 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-12-02 15:49:42,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-12-02 15:49:42,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2024-12-02 15:49:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 434 states have (on average 1.523041474654378) internal successors, (661), 585 states have internal predecessors, (661), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 15:49:42,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 667 transitions. [2024-12-02 15:49:42,794 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 667 transitions. Word has length 112 [2024-12-02 15:49:42,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:49:42,794 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 667 transitions. [2024-12-02 15:49:42,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.5) internal successors, (110), 5 states have internal predecessors, (110), 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-12-02 15:49:42,795 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 667 transitions. [2024-12-02 15:49:42,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-02 15:49:42,795 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:49:42,795 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, 1, 1] [2024-12-02 15:49:42,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-12-02 15:49:42,795 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:49:42,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:42,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1743797444, now seen corresponding path program 1 times [2024-12-02 15:49:42,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:42,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234983596] [2024-12-02 15:49:42,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:42,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:43,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-12-02 15:49:43,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:43,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234983596] [2024-12-02 15:49:43,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234983596] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:43,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:43,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 15:49:43,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099956008] [2024-12-02 15:49:43,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:43,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 15:49:43,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:43,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 15:49:43,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 15:49:43,168 INFO L87 Difference]: Start difference. First operand 591 states and 667 transitions. Second operand has 5 states, 4 states have (on average 27.5) internal successors, (110), 5 states have internal predecessors, (110), 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-12-02 15:49:46,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:49:46,988 INFO L93 Difference]: Finished difference Result 590 states and 666 transitions. [2024-12-02 15:49:46,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 15:49:46,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.5) internal successors, (110), 5 states have internal predecessors, (110), 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 112 [2024-12-02 15:49:46,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:49:46,990 INFO L225 Difference]: With dead ends: 590 [2024-12-02 15:49:46,990 INFO L226 Difference]: Without dead ends: 590 [2024-12-02 15:49:46,990 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-12-02 15:49:46,991 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 4 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-12-02 15:49:46,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1577 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-12-02 15:49:46,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-12-02 15:49:46,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2024-12-02 15:49:46,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 434 states have (on average 1.5207373271889402) internal successors, (660), 584 states have internal predecessors, (660), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 15:49:46,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 666 transitions. [2024-12-02 15:49:46,999 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 666 transitions. Word has length 112 [2024-12-02 15:49:47,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:49:47,000 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 666 transitions. [2024-12-02 15:49:47,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.5) internal successors, (110), 5 states have internal predecessors, (110), 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-12-02 15:49:47,000 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 666 transitions. [2024-12-02 15:49:47,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-02 15:49:47,001 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:49:47,001 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, 1, 1, 1] [2024-12-02 15:49:47,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-12-02 15:49:47,001 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:49:47,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:47,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1776853430, now seen corresponding path program 1 times [2024-12-02 15:49:47,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:47,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163673623] [2024-12-02 15:49:47,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:47,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:50,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:49:50,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:50,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163673623] [2024-12-02 15:49:50,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163673623] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:50,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:50,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-12-02 15:49:50,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977942894] [2024-12-02 15:49:50,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:50,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-12-02 15:49:50,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:50,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-12-02 15:49:50,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-12-02 15:49:50,332 INFO L87 Difference]: Start difference. First operand 590 states and 666 transitions. Second operand has 19 states, 18 states have (on average 6.166666666666667) internal successors, (111), 19 states have internal predecessors, (111), 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-12-02 15:50:11,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:50:11,764 INFO L93 Difference]: Finished difference Result 638 states and 719 transitions. [2024-12-02 15:50:11,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-12-02 15:50:11,765 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.166666666666667) internal successors, (111), 19 states have internal predecessors, (111), 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 113 [2024-12-02 15:50:11,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:50:11,766 INFO L225 Difference]: With dead ends: 638 [2024-12-02 15:50:11,766 INFO L226 Difference]: Without dead ends: 638 [2024-12-02 15:50:11,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2024-12-02 15:50:11,767 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 515 mSDsluCounter, 3985 mSDsCounter, 0 mSdLazyCounter, 3324 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 4306 SdHoareTripleChecker+Invalid, 3343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2024-12-02 15:50:11,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 4306 Invalid, 3343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3324 Invalid, 0 Unknown, 0 Unchecked, 19.6s Time] [2024-12-02 15:50:11,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-12-02 15:50:11,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 619. [2024-12-02 15:50:11,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 462 states have (on average 1.4913419913419914) internal successors, (689), 612 states have internal predecessors, (689), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-12-02 15:50:11,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 698 transitions. [2024-12-02 15:50:11,775 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 698 transitions. Word has length 113 [2024-12-02 15:50:11,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:50:11,775 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 698 transitions. [2024-12-02 15:50:11,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.166666666666667) internal successors, (111), 19 states have internal predecessors, (111), 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-12-02 15:50:11,775 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 698 transitions. [2024-12-02 15:50:11,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-02 15:50:11,776 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:50:11,776 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, 1, 1, 1] [2024-12-02 15:50:11,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-12-02 15:50:11,776 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:50:11,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:50:11,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1776853429, now seen corresponding path program 1 times [2024-12-02 15:50:11,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:50:11,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688532613] [2024-12-02 15:50:11,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:50:11,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:50:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:50:14,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:50:14,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:50:14,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688532613] [2024-12-02 15:50:14,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688532613] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:50:14,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:50:14,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-12-02 15:50:14,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462287289] [2024-12-02 15:50:14,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:50:14,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-12-02 15:50:14,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:50:14,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-12-02 15:50:14,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-12-02 15:50:14,939 INFO L87 Difference]: Start difference. First operand 619 states and 698 transitions. Second operand has 19 states, 18 states have (on average 6.166666666666667) internal successors, (111), 19 states have internal predecessors, (111), 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-12-02 15:50:39,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:50:39,917 INFO L93 Difference]: Finished difference Result 637 states and 718 transitions. [2024-12-02 15:50:39,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-12-02 15:50:39,918 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.166666666666667) internal successors, (111), 19 states have internal predecessors, (111), 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 113 [2024-12-02 15:50:39,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:50:39,921 INFO L225 Difference]: With dead ends: 637 [2024-12-02 15:50:39,921 INFO L226 Difference]: Without dead ends: 637 [2024-12-02 15:50:39,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2024-12-02 15:50:39,922 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 498 mSDsluCounter, 4015 mSDsCounter, 0 mSdLazyCounter, 3925 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 4345 SdHoareTripleChecker+Invalid, 3942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.2s IncrementalHoareTripleChecker+Time [2024-12-02 15:50:39,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 4345 Invalid, 3942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3925 Invalid, 0 Unknown, 0 Unchecked, 23.2s Time] [2024-12-02 15:50:39,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-12-02 15:50:39,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 619. [2024-12-02 15:50:39,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 461 states have (on average 1.492407809110629) internal successors, (688), 612 states have internal predecessors, (688), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-12-02 15:50:39,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 697 transitions. [2024-12-02 15:50:39,934 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 697 transitions. Word has length 113 [2024-12-02 15:50:39,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:50:39,935 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 697 transitions. [2024-12-02 15:50:39,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.166666666666667) internal successors, (111), 19 states have internal predecessors, (111), 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-12-02 15:50:39,935 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 697 transitions. [2024-12-02 15:50:39,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-02 15:50:39,936 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:50:39,936 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, 1, 1, 1, 1] [2024-12-02 15:50:39,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-12-02 15:50:39,936 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:50:39,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:50:39,937 INFO L85 PathProgramCache]: Analyzing trace with hash -554119649, now seen corresponding path program 1 times [2024-12-02 15:50:39,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:50:39,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48825845] [2024-12-02 15:50:39,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:50:39,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:50:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:50:43,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:50:43,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:50:43,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48825845] [2024-12-02 15:50:43,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48825845] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:50:43,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131820584] [2024-12-02 15:50:43,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:50:43,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:50:43,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:50:43,771 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:50:43,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-12-02 15:50:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:50:44,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-12-02 15:50:44,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:50:44,852 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 15:50:44,852 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-12-02 15:50:45,050 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-12-02 15:50:45,076 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-12-02 15:50:45,686 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:50:45,686 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-12-02 15:50:45,700 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 20 treesize of output 1 [2024-12-02 15:50:46,029 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:50:46,030 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-12-02 15:50:46,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-12-02 15:50:46,385 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:50:46,385 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-12-02 15:50:46,399 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 20 treesize of output 1 [2024-12-02 15:50:46,762 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:50:46,762 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-12-02 15:50:46,789 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 20 treesize of output 1 [2024-12-02 15:50:47,152 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:50:47,152 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-12-02 15:50:47,166 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 20 treesize of output 1 [2024-12-02 15:50:47,532 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-12-02 15:50:47,944 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-12-02 15:50:47,945 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 97 treesize of output 63 [2024-12-02 15:50:47,959 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 42 treesize of output 25 [2024-12-02 15:50:48,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 15:50:48,735 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-12-02 15:50:48,736 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 89 treesize of output 58 [2024-12-02 15:50:48,751 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 42 treesize of output 25 [2024-12-02 15:50:48,897 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 19 [2024-12-02 15:50:49,224 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-12-02 15:50:49,224 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-12-02 15:50:49,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:50:49,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:50:49,372 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4078 (Array Int Int)) (v_ArrVal_4079 (Array Int Int))) (or (not (= v_ArrVal_4078 (let ((.cse0 (+ 40 |c_ULTIMATE.start_main_#t~mem59#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base|) .cse0 (select v_ArrVal_4078 .cse0))))) (= (select |c_#valid| (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4078))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) 1))) is different from false [2024-12-02 15:50:49,434 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4078 (Array Int Int)) (v_ArrVal_4079 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select |c_#memory_$Pointer$#1.base| .cse1) .cse2 (select v_ArrVal_4078 .cse2))) v_ArrVal_4078)) (= (select |c_#valid| (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4078))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1))))) is different from false [2024-12-02 15:50:49,598 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (v_ArrVal_4079 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| |c_ULTIMATE.start_main_#t~malloc58#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4076))) (or (= (select |c_#valid| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4078))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= v_ArrVal_4078 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4078 .cse5))))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-12-02 15:50:49,624 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-12-02 15:50:49,740 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4079 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| |v_ULTIMATE.start_main_#t~malloc58#1.base_16|))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4076)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4078 (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4078 .cse4))))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4078))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-12-02 15:50:49,878 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4079 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse1 (+ |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|) .cse1))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse6 (store (select |c_#memory_$Pointer$#1.base| .cse6) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_4076))) (or (= (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4078))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4078 .cse5))) v_ArrVal_4078)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-12-02 15:50:50,161 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4074 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4073)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4074))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4076)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4078 (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4078 .cse4))))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4078))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-12-02 15:50:50,352 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4074 (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 ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4073))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4074))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse4 (store .cse6 .cse7 v_ArrVal_4076)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4078))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4078 .cse5))) v_ArrVal_4078)))))))))) is different from false [2024-12-02 15:50:50,813 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4074 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4071)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse10 .cse9 v_ArrVal_4073))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4072) .cse9 v_ArrVal_4074))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4076)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4078))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4078 .cse5))) v_ArrVal_4078)))))))))) is different from false [2024-12-02 15:50:50,946 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4074 (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_4071))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4073))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4072) .cse10 v_ArrVal_4074))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (store .cse6 .cse7 v_ArrVal_4076))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4078))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4078 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4078 .cse5))))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))) is different from false [2024-12-02 15:50:51,200 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4069 (Array Int Int)) (v_ArrVal_4070 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4074 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4069)) (.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_4071))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4073))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4070) .cse9 v_ArrVal_4072) .cse10 v_ArrVal_4074))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4076)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4078))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4078 (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4078 .cse5))))))))))))))) is different from false [2024-12-02 15:50:51,343 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4069 (Array Int Int)) (v_ArrVal_4070 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int) (v_ArrVal_4074 (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_4069))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4071))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4073))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4070) .cse10 v_ArrVal_4072) .cse11 v_ArrVal_4074))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4076)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse2 (store .cse3 .cse4 v_ArrVal_4078))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse3 .cse4) .cse5 (select v_ArrVal_4078 .cse5))) v_ArrVal_4078)))))))))))))) is different from false [2024-12-02 15:50:51,621 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4070 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (v_ArrVal_4074 (Array Int Int)) (v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4067 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (v_ArrVal_4068 (Array Int Int)) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4069 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4068)) (.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_4069))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4071))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4073))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4067) .cse9 v_ArrVal_4070) .cse10 v_ArrVal_4072) .cse11 v_ArrVal_4074))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_4076)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4078 .cse2))) v_ArrVal_4078)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4078))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2024-12-02 15:50:51,777 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4070 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (v_ArrVal_4074 (Array Int Int)) (v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4067 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (v_ArrVal_4068 (Array Int Int)) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4069 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| 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 ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4068))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4069))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4071))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4073))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4067) .cse10 v_ArrVal_4070) .cse11 v_ArrVal_4072) .cse12 v_ArrVal_4074))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4076)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (let ((.cse4 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_4078 .cse4))) v_ArrVal_4078)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_4078))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse3 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))))) is different from false [2024-12-02 15:50:52,270 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_16| Int) (v_ArrVal_4070 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int)) (v_ArrVal_4084 (Array Int Int)) (v_ArrVal_4073 (Array Int Int)) (v_ArrVal_4085 (Array Int Int)) (v_ArrVal_4074 (Array Int Int)) (v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4067 (Array Int Int)) (v_ArrVal_4078 (Array Int Int)) (v_ArrVal_4068 (Array Int Int)) (v_ArrVal_4079 (Array Int Int)) (v_ArrVal_4069 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_14| Int)) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4084)) (.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_4068))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4069))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4071))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4073))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse6 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4085) .cse9 v_ArrVal_4067) .cse10 v_ArrVal_4070) .cse11 v_ArrVal_4072) .cse12 v_ArrVal_4074))) (let ((.cse0 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) |v_ULTIMATE.start_main_#t~malloc58#1.base_16|)))) (let ((.cse3 (store .cse6 .cse7 v_ArrVal_4076)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_14|))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_4078 .cse2))) v_ArrVal_4078)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_14| (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_16| (select (let ((.cse5 (store .cse0 .cse1 v_ArrVal_4078))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (select (select (store .cse3 .cse1 v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))))) is different from false [2024-12-02 15:50:52,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131820584] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:50:52,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 15:50:52,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 32 [2024-12-02 15:50:52,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133685805] [2024-12-02 15:50:52,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 15:50:52,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-12-02 15:50:52,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:50:52,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-12-02 15:50:52,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=962, Unknown=14, NotChecked=1050, Total=2162 [2024-12-02 15:50:52,285 INFO L87 Difference]: Start difference. First operand 619 states and 697 transitions. Second operand has 33 states, 30 states have (on average 5.2) internal successors, (156), 33 states have internal predecessors, (156), 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-12-02 15:51:21,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:51:21,967 INFO L93 Difference]: Finished difference Result 635 states and 716 transitions. [2024-12-02 15:51:21,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-12-02 15:51:21,968 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 5.2) internal successors, (156), 33 states have internal predecessors, (156), 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 114 [2024-12-02 15:51:21,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:51:21,969 INFO L225 Difference]: With dead ends: 635 [2024-12-02 15:51:21,969 INFO L226 Difference]: Without dead ends: 635 [2024-12-02 15:51:21,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=254, Invalid=1950, Unknown=14, NotChecked=1442, Total=3660 [2024-12-02 15:51:21,970 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 491 mSDsluCounter, 5819 mSDsCounter, 0 mSdLazyCounter, 4616 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 6140 SdHoareTripleChecker+Invalid, 4640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 4616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.0s IncrementalHoareTripleChecker+Time [2024-12-02 15:51:21,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 6140 Invalid, 4640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 4616 Invalid, 0 Unknown, 0 Unchecked, 27.0s Time] [2024-12-02 15:51:21,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-12-02 15:51:21,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 618. [2024-12-02 15:51:21,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 461 states have (on average 1.490238611713666) internal successors, (687), 611 states have internal predecessors, (687), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-12-02 15:51:21,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 696 transitions. [2024-12-02 15:51:21,975 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 696 transitions. Word has length 114 [2024-12-02 15:51:21,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:51:21,975 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 696 transitions. [2024-12-02 15:51:21,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 5.2) internal successors, (156), 33 states have internal predecessors, (156), 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-12-02 15:51:21,975 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 696 transitions. [2024-12-02 15:51:21,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-02 15:51:21,976 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:51:21,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, 1, 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-12-02 15:51:21,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-12-02 15:51:22,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-12-02 15:51:22,176 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:51:22,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:51:22,177 INFO L85 PathProgramCache]: Analyzing trace with hash -554119648, now seen corresponding path program 1 times [2024-12-02 15:51:22,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:51:22,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886136597] [2024-12-02 15:51:22,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:51:22,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:51:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:51:26,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:51:26,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:51:26,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886136597] [2024-12-02 15:51:26,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886136597] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:51:26,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472032924] [2024-12-02 15:51:26,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:51:26,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:51:26,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:51:26,245 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:51:26,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-12-02 15:51:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:51:26,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-12-02 15:51:26,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:51:27,310 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 15:51:27,310 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-12-02 15:51:27,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 15:51:27,520 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-12-02 15:51:28,150 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:51:28,151 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-12-02 15:51:28,164 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 20 treesize of output 1 [2024-12-02 15:51:28,496 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:51:28,497 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-12-02 15:51:28,510 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 20 treesize of output 1 [2024-12-02 15:51:28,859 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:51:28,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-12-02 15:51:28,873 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 20 treesize of output 1 [2024-12-02 15:51:29,232 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:51:29,233 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-12-02 15:51:29,263 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 20 treesize of output 1 [2024-12-02 15:51:29,673 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:51:29,673 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-12-02 15:51:29,686 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 20 treesize of output 1 [2024-12-02 15:51:30,025 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-12-02 15:51:30,463 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-12-02 15:51:30,463 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 106 treesize of output 72 [2024-12-02 15:51:30,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2024-12-02 15:51:31,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 15:51:31,372 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-12-02 15:51:31,372 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 125 treesize of output 82 [2024-12-02 15:51:31,469 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-12-02 15:51:31,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 47 [2024-12-02 15:51:32,398 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-12-02 15:51:32,399 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 70 treesize of output 29 [2024-12-02 15:51:32,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:51:32,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:51:33,848 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base|)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base|)) (.cse6 (+ 40 |c_ULTIMATE.start_main_#t~mem59#1.offset|))) (and (forall ((v_ArrVal_4295 (Array Int Int))) (or (forall ((v_ArrVal_4297 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| (store .cse5 .cse6 v_ArrVal_4297))) (.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4295))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select .cse0 .cse1) .cse2) 384) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (= (store .cse7 .cse6 (select v_ArrVal_4295 .cse6)) v_ArrVal_4295)))) (forall ((v_ArrVal_4295 (Array Int Int))) (or (forall ((v_ArrVal_4297 Int)) (<= 0 (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| (store .cse5 .cse6 v_ArrVal_4297)))) (select (select .cse8 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))) (not (= (store .cse7 .cse6 (select v_ArrVal_4295 .cse6)) v_ArrVal_4295)))))) is different from false [2024-12-02 15:51:34,002 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |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|) .cse7))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse1 (select |c_#memory_$Pointer$#1.base| .cse8)) (.cse9 (select |c_#memory_$Pointer$#1.offset| .cse8))) (and (forall ((|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse0) (forall ((v_ArrVal_4295 (Array Int Int))) (let ((.cse2 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= v_ArrVal_4295 (store .cse1 .cse2 (select v_ArrVal_4295 .cse2)))) (forall ((v_ArrVal_4297 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| .cse8 (store .cse9 .cse2 v_ArrVal_4297))) (.cse6 (store |c_#memory_$Pointer$#1.base| .cse8 v_ArrVal_4295))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse5 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (<= (+ (select (select .cse3 .cse4) .cse5) 384) (select |c_#length| (select (select .cse6 .cse4) .cse5))))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse0) (forall ((v_ArrVal_4295 (Array Int Int))) (let ((.cse10 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= v_ArrVal_4295 (store .cse1 .cse10 (select v_ArrVal_4295 .cse10)))) (forall ((v_ArrVal_4297 Int)) (<= 0 (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| .cse8 (store .cse9 .cse10 v_ArrVal_4297)))) (select (select .cse11 (select (select (store |c_#memory_$Pointer$#1.base| .cse8 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)))))))))))))) is different from false [2024-12-02 15:51:34,321 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| |c_ULTIMATE.start_main_#t~malloc58#1.base|))) (.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| |c_ULTIMATE.start_main_#t~malloc58#1.offset|)))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse11 (select .cse6 .cse7)) (.cse9 (select .cse8 .cse7))) (and (forall ((|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse0) (forall ((v_ArrVal_4295 (Array Int Int))) (let ((.cse10 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (forall ((v_ArrVal_4297 Int)) (let ((.cse1 (store .cse8 .cse7 (store .cse9 .cse10 v_ArrVal_4297))) (.cse4 (store .cse6 .cse7 v_ArrVal_4295))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (<= (+ (select (select .cse1 .cse2) .cse3) 384) (select |c_#length| (select (select .cse4 .cse2) .cse3)))))) (not (= v_ArrVal_4295 (store .cse11 .cse10 (select v_ArrVal_4295 .cse10))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse0) (forall ((v_ArrVal_4295 (Array Int Int))) (let ((.cse12 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= v_ArrVal_4295 (store .cse11 .cse12 (select v_ArrVal_4295 .cse12)))) (forall ((v_ArrVal_4297 Int)) (<= 0 (let ((.cse13 (store .cse8 .cse7 (store .cse9 .cse12 v_ArrVal_4297)))) (select (select .cse13 (select (select (store .cse6 .cse7 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))) is different from false [2024-12-02 15:51:34,357 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 942 treesize of output 820 [2024-12-02 15:51:35,070 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base|) |c_ULTIMATE.start_main_#t~mem57#1.offset| 0))) (.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base|))) (and (forall ((v_prenex_60 (Array Int Int)) (v_prenex_62 Int) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem57#1.offset| |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse2 (+ 40 v_prenex_62))) (or (not (= (store (select .cse0 .cse1) .cse2 (select v_prenex_60 .cse2)) v_prenex_60)) (< v_prenex_62 .cse3) (< 0 (+ (let ((.cse4 (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 v_prenex_61)))) (select (select .cse4 (select (select (store .cse0 .cse1 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) 1)))))) (forall ((v_ArrVal_4295 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem57#1.offset| |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse10 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= (store (select .cse8 .cse9) .cse10 (select v_ArrVal_4295 .cse10)) v_ArrVal_4295)) (= (select (let ((.cse11 (store .cse8 .cse9 v_ArrVal_4295))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (select (select (store .cse6 .cse9 (store (select .cse6 .cse9) .cse10 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) |v_ULTIMATE.start_main_#t~malloc58#1.base_19|) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse3))))) (forall ((v_ArrVal_4295 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem57#1.offset| |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse14 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= (store (select .cse12 .cse13) .cse14 (select v_ArrVal_4295 .cse14)) v_ArrVal_4295)) (< (let ((.cse15 (store .cse6 .cse13 (store (select .cse6 .cse13) .cse14 v_ArrVal_4297)))) (select (select .cse15 (select (select (store .cse12 .cse13 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) 1) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| .cse3)))))))) is different from false [2024-12-02 15:51:36,762 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4289)) (.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4290))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse4 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4295))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse4 .cse3 (store (select .cse4 .cse3) .cse5 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4295 (store (select .cse2 .cse3) .cse5 (select v_ArrVal_4295 .cse5)))))))))) (forall ((v_prenex_60 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4289)) (.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4290))) (let ((.cse16 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse17 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse18 .cse16 (store (select .cse18 .cse16) .cse17 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse13 (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 0))) (.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse12 (+ 40 v_prenex_62))) (or (not (= (store (select .cse10 .cse11) .cse12 (select v_prenex_60 .cse12)) v_prenex_60)) (< v_prenex_62 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse14 (store .cse13 .cse11 (store (select .cse13 .cse11) .cse12 v_prenex_61)))) (select (select .cse14 (select (select (store .cse10 .cse11 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)))))))) (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse24 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4289)) (.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4290))) (let ((.cse25 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse26 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse20 (store .cse27 .cse25 (store (select .cse27 .cse25) .cse26 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse19 (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 0))) (.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse22 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4295 (store (select .cse20 .cse21) .cse22 (select v_ArrVal_4295 .cse22)))) (< (let ((.cse23 (store .cse19 .cse21 (store (select .cse19 .cse21) .cse22 v_ArrVal_4297)))) (select (select .cse23 (select (select (store .cse20 .cse21 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1))))))))) is different from false [2024-12-02 15:51:37,267 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_4289)) (.cse6 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_4290))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0))) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< (let ((.cse1 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store .cse4 .cse2 (store (select .cse4 .cse2) .cse5 v_ArrVal_4297)))) (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) 1) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= v_ArrVal_4295 (store (let ((.cse9 (store .cse6 .cse7 (store v_ArrVal_4290 .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse5 (select v_ArrVal_4295 .cse5))))))))) (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse17 (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_4289)) (.cse20 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_4290))) (let ((.cse18 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse19 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse13 (store .cse20 .cse18 (store (select .cse20 .cse18) .cse19 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse15 (store .cse17 .cse18 (store (select .cse17 .cse18) .cse19 0))) (.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse16 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (= (select (let ((.cse12 (store .cse13 .cse14 v_ArrVal_4295))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (select (select (store .cse15 .cse14 (store (select .cse15 .cse14) .cse16 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) |v_ULTIMATE.start_main_#t~malloc58#1.base_19|) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (not (= v_ArrVal_4295 (store (select .cse13 .cse14) .cse16 (select v_ArrVal_4295 .cse16)))))))))) (forall ((v_prenex_60 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int)) (let ((.cse30 (store |c_#memory_$Pointer$#1.offset| .cse11 v_ArrVal_4289)) (.cse22 (store |c_#memory_$Pointer$#1.base| .cse11 v_ArrVal_4290))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse24 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse26 (store .cse30 .cse23 (store (select .cse30 .cse23) .cse24 0))) (.cse25 (+ 40 v_prenex_62))) (or (not (= (store (let ((.cse21 (store .cse22 .cse23 (store v_ArrVal_4290 .cse24 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) .cse25 (select v_prenex_60 .cse25)) v_prenex_60)) (< v_prenex_62 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (< 0 (+ (let ((.cse28 (store .cse22 .cse23 (store (select .cse22 .cse23) .cse24 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse29 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse27 (store .cse26 .cse29 (store (select .cse26 .cse29) .cse25 v_prenex_61)))) (select (select .cse27 (select (select (store .cse28 .cse29 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))) 1)))))))))) is different from false [2024-12-02 15:51:39,856 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_60 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4287))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4288) .cse12 v_ArrVal_4289)) (.cse6 (store .cse11 .cse12 v_ArrVal_4290))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0))) (.cse5 (+ 40 v_prenex_62))) (or (< v_prenex_62 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse3 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse0 .cse4 (store (select .cse0 .cse4) .cse5 v_prenex_61)))) (select (select .cse2 (select (select (store .cse3 .cse4 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (not (= v_prenex_60 (store (let ((.cse9 (store .cse6 .cse7 (store v_ArrVal_4290 .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_prenex_60 .cse5))))))))))) (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4287))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse22 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4288) .cse24 v_ArrVal_4289)) (.cse18 (store .cse23 .cse24 v_ArrVal_4290))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse20 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse22 .cse19 (store (select .cse22 .cse19) .cse20 0))) (.cse17 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< (let ((.cse14 (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse16 .cse15 (store (select .cse16 .cse15) .cse17 v_ArrVal_4297)))) (select (select .cse13 (select (select (store .cse14 .cse15 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4295 (store (let ((.cse21 (store .cse18 .cse19 (store v_ArrVal_4290 .cse20 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse17 (select v_ArrVal_4295 .cse17))))))))))) (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse34 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4287))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse30 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_4288) .cse35 v_ArrVal_4289)) (.cse33 (store .cse34 .cse35 v_ArrVal_4290))) (let ((.cse31 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse32 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse26 (store .cse33 .cse31 (store (select .cse33 .cse31) .cse32 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse25 (store .cse30 .cse31 (store (select .cse30 .cse31) .cse32 0))) (.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse28 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4295 (store (select .cse26 .cse27) .cse28 (select v_ArrVal_4295 .cse28)))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse29 (store .cse26 .cse27 v_ArrVal_4295))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse25 .cse27 (store (select .cse25 .cse27) .cse28 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) is different from false [2024-12-02 15:51:42,059 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4287))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4288) .cse12 v_ArrVal_4289)) (.cse6 (store .cse11 .cse12 v_ArrVal_4290))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0))) (.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (let ((.cse3 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse0 .cse4 (store (select .cse0 .cse4) .cse5 v_ArrVal_4297)))) (select (select .cse2 (select (select (store .cse3 .cse4 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1) (not (= (store (let ((.cse9 (store .cse6 .cse7 (store v_ArrVal_4290 .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_ArrVal_4295 .cse5)) v_ArrVal_4295))))))))) (forall ((v_prenex_60 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int)) (let ((.cse24 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4287))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse23 (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4288) .cse25 v_ArrVal_4289)) (.cse19 (store .cse24 .cse25 v_ArrVal_4290))) (let ((.cse20 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse21 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse17 (store .cse23 .cse20 (store (select .cse23 .cse20) .cse21 0))) (.cse18 (+ 40 v_prenex_62))) (or (< 0 (+ (let ((.cse15 (store .cse19 .cse20 (store (select .cse19 .cse20) .cse21 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse17 .cse16 (store (select .cse17 .cse16) .cse18 v_prenex_61)))) (select (select .cse14 (select (select (store .cse15 .cse16 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (< v_prenex_62 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_prenex_60 (store (let ((.cse22 (store .cse19 .cse20 (store v_ArrVal_4290 .cse21 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse18 (select v_prenex_60 .cse18))))))))))) (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse35 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4287))) (let ((.cse36 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse31 (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4288) .cse36 v_ArrVal_4289)) (.cse34 (store .cse35 .cse36 v_ArrVal_4290))) (let ((.cse32 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse33 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse28 (store .cse34 .cse32 (store (select .cse34 .cse32) .cse33 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse26 (store .cse31 .cse32 (store (select .cse31 .cse32) .cse33 0))) (.cse29 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse30 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse27 (store .cse28 .cse29 v_ArrVal_4295))) (select .cse27 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse26 .cse29 (store (select .cse26 .cse29) .cse30 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_ArrVal_4295 (store (select .cse28 .cse29) .cse30 (select v_ArrVal_4295 .cse30))))))))))))))) is different from false [2024-12-02 15:51:57,093 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4286))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse14 .cse13 v_ArrVal_4287))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4285) .cse13 v_ArrVal_4288) .cse12 v_ArrVal_4289)) (.cse3 (store .cse11 .cse12 v_ArrVal_4290))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse10 .cse4 (store (select .cse10 .cse4) .cse5 0))) (.cse6 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (let ((.cse2 (store .cse3 .cse4 (store v_ArrVal_4290 .cse5 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse6 (select v_ArrVal_4295 .cse6)) v_ArrVal_4295)) (< (let ((.cse8 (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store .cse0 .cse9 (store (select .cse0 .cse9) .cse6 v_ArrVal_4297)))) (select (select .cse7 (select (select (store .cse8 .cse9 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)))))))))) (forall ((v_ArrVal_4285 (Array Int Int)) (v_prenex_60 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int)) (let ((.cse28 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4286))) (let ((.cse27 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse25 (store .cse28 .cse27 v_ArrVal_4287))) (let ((.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse24 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4285) .cse27 v_ArrVal_4288) .cse26 v_ArrVal_4289)) (.cse16 (store .cse25 .cse26 v_ArrVal_4290))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse18 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse19 (+ 40 v_prenex_62)) (.cse23 (store .cse24 .cse17 (store (select .cse24 .cse17) .cse18 0)))) (or (not (= v_prenex_60 (store (let ((.cse15 (store .cse16 .cse17 (store v_ArrVal_4290 .cse18 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse19 (select v_prenex_60 .cse19)))) (< 0 (+ (let ((.cse21 (store .cse16 .cse17 (store (select .cse16 .cse17) .cse18 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse22 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse20 (store .cse23 .cse22 (store (select .cse23 .cse22) .cse19 v_prenex_61)))) (select (select .cse20 (select (select (store .cse21 .cse22 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (< v_prenex_62 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse41 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4286))) (let ((.cse40 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse38 (store .cse41 .cse40 v_ArrVal_4287))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse34 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4285) .cse40 v_ArrVal_4288) .cse39 v_ArrVal_4289)) (.cse37 (store .cse38 .cse39 v_ArrVal_4290))) (let ((.cse35 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse36 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse29 (store .cse37 .cse35 (store (select .cse37 .cse35) .cse36 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse32 (store .cse34 .cse35 (store (select .cse34 .cse35) .cse36 0))) (.cse30 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse31 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (not (= (store (select .cse29 .cse30) .cse31 (select v_ArrVal_4295 .cse31)) v_ArrVal_4295)) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse33 (store .cse29 .cse30 v_ArrVal_4295))) (select .cse33 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse32 .cse30 (store (select .cse32 .cse30) .cse31 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))) is different from false [2024-12-02 15:51:57,615 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4285 (Array Int Int)) (v_prenex_60 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4286))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse15 .cse14 v_ArrVal_4287))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4285) .cse14 v_ArrVal_4288) .cse12 v_ArrVal_4289)) (.cse6 (store .cse11 .cse12 v_ArrVal_4290))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0))) (.cse5 (+ 40 v_prenex_62))) (or (< v_prenex_62 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse3 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse0 .cse4 (store (select .cse0 .cse4) .cse5 v_prenex_61)))) (select (select .cse2 (select (select (store .cse3 .cse4 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (not (= v_prenex_60 (store (let ((.cse9 (store .cse6 .cse7 (store v_ArrVal_4290 .cse8 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_prenex_60 .cse5))))))))))))) (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse28 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4286))) (let ((.cse27 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse25 (store .cse28 .cse27 v_ArrVal_4287))) (let ((.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse21 (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4285) .cse27 v_ArrVal_4288) .cse26 v_ArrVal_4289)) (.cse24 (store .cse25 .cse26 v_ArrVal_4290))) (let ((.cse22 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse23 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse17 (store .cse24 .cse22 (store (select .cse24 .cse22) .cse23 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse19 (store .cse21 .cse22 (store (select .cse21 .cse22) .cse23 0))) (.cse18 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse20 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse16 (store .cse17 .cse18 v_ArrVal_4295))) (select .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse19 .cse18 (store (select .cse19 .cse18) .cse20 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4295 (store (select .cse17 .cse18) .cse20 (select v_ArrVal_4295 .cse20)))))))))))))) (forall ((v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse42 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4286))) (let ((.cse41 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse39 (store .cse42 .cse41 v_ArrVal_4287))) (let ((.cse40 (select (select .cse39 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse38 (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4285) .cse41 v_ArrVal_4288) .cse40 v_ArrVal_4289)) (.cse31 (store .cse39 .cse40 v_ArrVal_4290))) (let ((.cse32 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse33 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse29 (store .cse38 .cse32 (store (select .cse38 .cse32) .cse33 0))) (.cse34 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4295 (store (let ((.cse30 (store .cse31 .cse32 (store v_ArrVal_4290 .cse33 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse30 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse34 (select v_ArrVal_4295 .cse34)))) (< (let ((.cse36 (store .cse31 .cse32 (store (select .cse31 .cse32) .cse33 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse37 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse35 (store .cse29 .cse37 (store (select .cse29 .cse37) .cse34 v_ArrVal_4297)))) (select (select .cse35 (select (select (store .cse36 .cse37 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1))))))))))))) is different from false [2024-12-02 15:51:58,479 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4283 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4284))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_4286))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse15 .cse14 v_ArrVal_4287))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4283) .cse13 v_ArrVal_4285) .cse14 v_ArrVal_4288) .cse12 v_ArrVal_4289)) (.cse2 (store .cse11 .cse12 v_ArrVal_4290))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse9 (store .cse10 .cse3 (store (select .cse10 .cse3) .cse4 0)))) (or (not (= v_ArrVal_4295 (store (let ((.cse0 (store .cse2 .cse3 (store v_ArrVal_4290 .cse4 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_ArrVal_4295 .cse5)))) (< (let ((.cse7 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store .cse9 .cse8 (store (select .cse9 .cse8) .cse5 v_ArrVal_4297)))) (select (select .cse6 (select (select (store .cse7 .cse8 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))) (forall ((v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_prenex_60 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int) (v_ArrVal_4283 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4284))) (let ((.cse29 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse31 (store .cse32 .cse29 v_ArrVal_4286))) (let ((.cse30 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse27 (store .cse31 .cse30 v_ArrVal_4287))) (let ((.cse28 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse26 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4283) .cse29 v_ArrVal_4285) .cse30 v_ArrVal_4288) .cse28 v_ArrVal_4289)) (.cse18 (store .cse27 .cse28 v_ArrVal_4290))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse20 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse22 (store .cse26 .cse19 (store (select .cse26 .cse19) .cse20 0))) (.cse21 (+ 40 v_prenex_62))) (or (not (= (store (let ((.cse17 (store .cse18 .cse19 (store v_ArrVal_4290 .cse20 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse21 (select v_prenex_60 .cse21)) v_prenex_60)) (< v_prenex_62 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse24 (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse23 (store .cse22 .cse25 (store (select .cse22 .cse25) .cse21 v_prenex_61)))) (select (select .cse23 (select (select (store .cse24 .cse25 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1))))))))))))) (forall ((v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4283 (Array Int Int))) (let ((.cse47 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4284))) (let ((.cse44 (select (select .cse47 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse46 (store .cse47 .cse44 v_ArrVal_4286))) (let ((.cse45 (select (select .cse46 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse42 (store .cse46 .cse45 v_ArrVal_4287))) (let ((.cse43 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse38 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_4283) .cse44 v_ArrVal_4285) .cse45 v_ArrVal_4288) .cse43 v_ArrVal_4289)) (.cse41 (store .cse42 .cse43 v_ArrVal_4290))) (let ((.cse39 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse40 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse33 (store .cse41 .cse39 (store (select .cse41 .cse39) .cse40 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse34 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse35 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|)) (.cse37 (store .cse38 .cse39 (store (select .cse38 .cse39) .cse40 0)))) (or (not (= v_ArrVal_4295 (store (select .cse33 .cse34) .cse35 (select v_ArrVal_4295 .cse35)))) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse36 (store .cse33 .cse34 v_ArrVal_4295))) (select .cse36 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse37 .cse34 (store (select .cse37 .cse34) .cse35 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))))))) is different from false [2024-12-02 15:51:59,025 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_prenex_60 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int) (v_ArrVal_4283 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4284))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_4286))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse16 .cse15 v_ArrVal_4287))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4283) .cse14 v_ArrVal_4285) .cse15 v_ArrVal_4288) .cse12 v_ArrVal_4289)) (.cse2 (store .cse11 .cse12 v_ArrVal_4290))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store .cse10 .cse3 (store (select .cse10 .cse3) .cse4 0))) (.cse5 (+ 40 v_prenex_62))) (or (not (= v_prenex_60 (store (let ((.cse0 (store .cse2 .cse3 (store v_ArrVal_4290 .cse4 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse5 (select v_prenex_60 .cse5)))) (< v_prenex_62 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse8 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store .cse6 .cse9 (store (select .cse6 .cse9) .cse5 v_prenex_61)))) (select (select .cse7 (select (select (store .cse8 .cse9 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1))))))))))))) (forall ((v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4283 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4284))) (let ((.cse29 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse31 (store .cse32 .cse29 v_ArrVal_4286))) (let ((.cse30 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse27 (store .cse31 .cse30 v_ArrVal_4287))) (let ((.cse28 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse23 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4283) .cse29 v_ArrVal_4285) .cse30 v_ArrVal_4288) .cse28 v_ArrVal_4289)) (.cse26 (store .cse27 .cse28 v_ArrVal_4290))) (let ((.cse24 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse25 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse19 (store .cse26 .cse24 (store (select .cse26 .cse24) .cse25 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse18 (store .cse23 .cse24 (store (select .cse23 .cse24) .cse25 0))) (.cse20 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse21 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select .cse19 .cse20) .cse21 (select v_ArrVal_4295 .cse21)) v_ArrVal_4295)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse22 (store .cse19 .cse20 v_ArrVal_4295))) (select .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse18 .cse20 (store (select .cse18 .cse20) .cse21 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))) (forall ((v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int) (v_ArrVal_4283 (Array Int Int))) (let ((.cse48 (store |c_#memory_$Pointer$#1.base| .cse13 v_ArrVal_4284))) (let ((.cse45 (select (select .cse48 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse47 (store .cse48 .cse45 v_ArrVal_4286))) (let ((.cse46 (select (select .cse47 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse43 (store .cse47 .cse46 v_ArrVal_4287))) (let ((.cse44 (select (select .cse43 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse42 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse13 v_ArrVal_4283) .cse45 v_ArrVal_4285) .cse46 v_ArrVal_4288) .cse44 v_ArrVal_4289)) (.cse38 (store .cse43 .cse44 v_ArrVal_4290))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse40 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse33 (store .cse42 .cse39 (store (select .cse42 .cse39) .cse40 0))) (.cse37 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< (let ((.cse35 (store .cse38 .cse39 (store (select .cse38 .cse39) .cse40 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse36 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse34 (store .cse33 .cse36 (store (select .cse33 .cse36) .cse37 v_ArrVal_4297)))) (select (select .cse34 (select (select (store .cse35 .cse36 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1) (not (= v_ArrVal_4295 (store (let ((.cse41 (store .cse38 .cse39 (store v_ArrVal_4290 .cse40 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse41 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse37 (select v_ArrVal_4295 .cse37)))))))))))))))))) is different from false [2024-12-02 15:52:00,284 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (v_ArrVal_4283 (Array Int Int)) (v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4302 (Array Int Int)) (v_ArrVal_4303 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4302))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_4284))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_4286))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse16 .cse15 v_ArrVal_4287))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4303) .cse13 v_ArrVal_4283) .cse14 v_ArrVal_4285) .cse15 v_ArrVal_4288) .cse12 v_ArrVal_4289)) (.cse3 (store .cse11 .cse12 v_ArrVal_4290))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store .cse10 .cse4 (store (select .cse10 .cse4) .cse5 0))) (.cse6 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_ArrVal_4295 (store (let ((.cse2 (store .cse3 .cse4 (store v_ArrVal_4290 .cse5 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse6 (select v_ArrVal_4295 .cse6)))) (< (let ((.cse8 (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store .cse0 .cse9 (store (select .cse0 .cse9) .cse6 v_ArrVal_4297)))) (select (select .cse7 (select (select (store .cse8 .cse9 v_ArrVal_4295) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)))))))))))))) (forall ((v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_ArrVal_4297 Int) (v_ArrVal_4283 (Array Int Int)) (v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4295 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4302 (Array Int Int)) (v_ArrVal_4303 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem59#1.offset_17| Int)) (let ((.cse35 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4302))) (let ((.cse30 (select (select .cse35 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse34 (store .cse35 .cse30 v_ArrVal_4284))) (let ((.cse31 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse33 (store .cse34 .cse31 v_ArrVal_4286))) (let ((.cse32 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse28 (store .cse33 .cse32 v_ArrVal_4287))) (let ((.cse29 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse24 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4303) .cse30 v_ArrVal_4283) .cse31 v_ArrVal_4285) .cse32 v_ArrVal_4288) .cse29 v_ArrVal_4289)) (.cse27 (store .cse28 .cse29 v_ArrVal_4290))) (let ((.cse25 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse26 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse20 (store .cse27 .cse25 (store (select .cse27 .cse25) .cse26 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse19 (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 0))) (.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse22 (+ 40 |v_ULTIMATE.start_main_#t~mem59#1.offset_17|))) (or (< |v_ULTIMATE.start_main_#t~mem59#1.offset_17| (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= (store (select .cse20 .cse21) .cse22 (select v_ArrVal_4295 .cse22)) v_ArrVal_4295)) (= |v_ULTIMATE.start_main_#t~malloc58#1.base_19| (select (let ((.cse23 (store .cse20 .cse21 v_ArrVal_4295))) (select .cse23 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse19 .cse21 (store (select .cse19 .cse21) .cse22 v_ArrVal_4297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))))) (forall ((v_prenex_62 Int) (v_ArrVal_4290 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_19| Int) (v_prenex_61 Int) (v_ArrVal_4283 (Array Int Int)) (v_ArrVal_4284 (Array Int Int)) (v_ArrVal_4285 (Array Int Int)) (v_prenex_60 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4302 (Array Int Int)) (v_ArrVal_4303 (Array Int Int))) (let ((.cse53 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4302))) (let ((.cse48 (select (select .cse53 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse52 (store .cse53 .cse48 v_ArrVal_4284))) (let ((.cse49 (select (select .cse52 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse51 (store .cse52 .cse49 v_ArrVal_4286))) (let ((.cse50 (select (select .cse51 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse46 (store .cse51 .cse50 v_ArrVal_4287))) (let ((.cse47 (select (select .cse46 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse45 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_4303) .cse48 v_ArrVal_4283) .cse49 v_ArrVal_4285) .cse50 v_ArrVal_4288) .cse47 v_ArrVal_4289)) (.cse37 (store .cse46 .cse47 v_ArrVal_4290))) (let ((.cse38 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse39 (select (select .cse45 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse40 (+ 40 v_prenex_62)) (.cse44 (store .cse45 .cse38 (store (select .cse45 .cse38) .cse39 0)))) (or (not (= v_prenex_60 (store (let ((.cse36 (store .cse37 .cse38 (store v_ArrVal_4290 .cse39 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (select .cse36 (select (select .cse36 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse40 (select v_prenex_60 .cse40)))) (< 0 (+ (let ((.cse42 (store .cse37 .cse38 (store (select .cse37 .cse38) .cse39 |v_ULTIMATE.start_main_#t~malloc58#1.base_19|)))) (let ((.cse43 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse41 (store .cse44 .cse43 (store (select .cse44 .cse43) .cse40 v_prenex_61)))) (select (select .cse41 (select (select (store .cse42 .cse43 v_prenex_60) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) 1)) (< v_prenex_62 (select (select .cse44 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))))) is different from false [2024-12-02 15:52:00,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472032924] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:52:00,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 15:52:00,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 34 [2024-12-02 15:52:00,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879401520] [2024-12-02 15:52:00,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 15:52:00,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-12-02 15:52:00,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:52:00,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-12-02 15:52:00,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1345, Unknown=13, NotChecked=1118, Total=2652 [2024-12-02 15:52:00,359 INFO L87 Difference]: Start difference. First operand 618 states and 696 transitions. Second operand has 35 states, 32 states have (on average 4.90625) internal successors, (157), 35 states have internal predecessors, (157), 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-12-02 15:52:53,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:52:53,583 INFO L93 Difference]: Finished difference Result 634 states and 715 transitions. [2024-12-02 15:52:53,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-12-02 15:52:53,584 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 4.90625) internal successors, (157), 35 states have internal predecessors, (157), 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 114 [2024-12-02 15:52:53,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:52:53,586 INFO L225 Difference]: With dead ends: 634 [2024-12-02 15:52:53,586 INFO L226 Difference]: Without dead ends: 634 [2024-12-02 15:52:53,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=328, Invalid=2573, Unknown=13, NotChecked=1508, Total=4422 [2024-12-02 15:52:53,587 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 557 mSDsluCounter, 7572 mSDsCounter, 0 mSdLazyCounter, 7019 mSolverCounterSat, 26 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 7890 SdHoareTripleChecker+Invalid, 7047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 7019 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.3s IncrementalHoareTripleChecker+Time [2024-12-02 15:52:53,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 7890 Invalid, 7047 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 7019 Invalid, 2 Unknown, 0 Unchecked, 49.3s Time] [2024-12-02 15:52:53,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-12-02 15:52:53,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 588. [2024-12-02 15:52:53,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 433 states have (on average 1.5196304849884525) internal successors, (658), 582 states have internal predecessors, (658), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 15:52:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 664 transitions. [2024-12-02 15:52:53,594 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 664 transitions. Word has length 114 [2024-12-02 15:52:53,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:52:53,594 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 664 transitions. [2024-12-02 15:52:53,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 4.90625) internal successors, (157), 35 states have internal predecessors, (157), 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-12-02 15:52:53,594 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 664 transitions. [2024-12-02 15:52:53,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-12-02 15:52:53,595 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:52:53,595 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 15:52:53,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-12-02 15:52:53,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:52:53,795 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr135REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:52:53,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:52:53,796 INFO L85 PathProgramCache]: Analyzing trace with hash -655482028, now seen corresponding path program 1 times [2024-12-02 15:52:53,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:52:53,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272443492] [2024-12-02 15:52:53,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:52:53,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:52:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:52:53,975 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-02 15:52:53,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:52:53,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272443492] [2024-12-02 15:52:53,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272443492] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:52:53,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:52:53,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 15:52:53,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14953550] [2024-12-02 15:52:53,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:52:53,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 15:52:53,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:52:53,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 15:52:53,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 15:52:53,976 INFO L87 Difference]: Start difference. First operand 588 states and 664 transitions. Second operand has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 4 states have internal predecessors, (115), 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-12-02 15:52:56,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:52:56,845 INFO L93 Difference]: Finished difference Result 691 states and 799 transitions. [2024-12-02 15:52:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 15:52:56,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 4 states have internal predecessors, (115), 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 123 [2024-12-02 15:52:56,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:52:56,848 INFO L225 Difference]: With dead ends: 691 [2024-12-02 15:52:56,848 INFO L226 Difference]: Without dead ends: 691 [2024-12-02 15:52:56,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 15:52:56,848 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 887 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-12-02 15:52:56,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 600 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-12-02 15:52:56,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-12-02 15:52:56,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 691. [2024-12-02 15:52:56,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 543 states have (on average 1.4604051565377532) internal successors, (793), 685 states have internal predecessors, (793), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 15:52:56,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 799 transitions. [2024-12-02 15:52:56,855 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 799 transitions. Word has length 123 [2024-12-02 15:52:56,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:52:56,855 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 799 transitions. [2024-12-02 15:52:56,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 4 states have internal predecessors, (115), 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-12-02 15:52:56,855 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 799 transitions. [2024-12-02 15:52:56,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-12-02 15:52:56,855 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:52:56,856 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 15:52:56,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-12-02 15:52:56,856 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr136REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:52:56,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:52:56,856 INFO L85 PathProgramCache]: Analyzing trace with hash -655482027, now seen corresponding path program 1 times [2024-12-02 15:52:56,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:52:56,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268223112] [2024-12-02 15:52:56,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:52:56,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:52:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:52:57,147 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-02 15:52:57,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:52:57,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268223112] [2024-12-02 15:52:57,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268223112] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:52:57,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:52:57,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 15:52:57,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992023967] [2024-12-02 15:52:57,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:52:57,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 15:52:57,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:52:57,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 15:52:57,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 15:52:57,148 INFO L87 Difference]: Start difference. First operand 691 states and 799 transitions. Second operand has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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-12-02 15:53:00,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:53:00,384 INFO L93 Difference]: Finished difference Result 902 states and 1046 transitions. [2024-12-02 15:53:00,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 15:53:00,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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 123 [2024-12-02 15:53:00,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:53:00,388 INFO L225 Difference]: With dead ends: 902 [2024-12-02 15:53:00,388 INFO L226 Difference]: Without dead ends: 902 [2024-12-02 15:53:00,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:53:00,388 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 1345 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1347 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-12-02 15:53:00,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1347 Valid, 741 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-12-02 15:53:00,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-12-02 15:53:00,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 856. [2024-12-02 15:53:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 708 states have (on average 1.4562146892655368) internal successors, (1031), 850 states have internal predecessors, (1031), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-12-02 15:53:00,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1037 transitions. [2024-12-02 15:53:00,396 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1037 transitions. Word has length 123 [2024-12-02 15:53:00,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:53:00,396 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1037 transitions. [2024-12-02 15:53:00,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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-12-02 15:53:00,396 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1037 transitions. [2024-12-02 15:53:00,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-12-02 15:53:00,396 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:53:00,397 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 15:53:00,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-12-02 15:53:00,397 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:53:00,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:53:00,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1154894375, now seen corresponding path program 1 times [2024-12-02 15:53:00,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:53:00,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926892871] [2024-12-02 15:53:00,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:53:00,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:53:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:53:00,651 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 15:53:00,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:53:00,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926892871] [2024-12-02 15:53:00,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926892871] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:53:00,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101267997] [2024-12-02 15:53:00,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:53:00,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:53:00,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:53:00,653 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:53:00,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-12-02 15:53:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:53:00,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-12-02 15:53:00,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:53:01,935 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 15:53:01,935 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-12-02 15:53:02,033 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-12-02 15:53:02,731 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:53:02,731 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-12-02 15:53:03,036 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:53:03,036 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-12-02 15:53:03,313 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:53:03,313 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-12-02 15:53:03,585 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:53:03,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-12-02 15:53:03,895 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:53:03,895 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-12-02 15:53:04,451 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:53:04,451 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-12-02 15:53:04,657 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-12-02 15:53:05,630 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-12-02 15:53:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:53:05,890 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 15:53:05,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101267997] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:53:05,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 15:53:05,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [4] total 20 [2024-12-02 15:53:05,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256178325] [2024-12-02 15:53:05,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:53:05,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-12-02 15:53:05,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:53:05,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-12-02 15:53:05,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2024-12-02 15:53:05,893 INFO L87 Difference]: Start difference. First operand 856 states and 1037 transitions. Second operand has 18 states, 16 states have (on average 7.5) internal successors, (120), 18 states have internal predecessors, (120), 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-12-02 15:53:33,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:53:33,393 INFO L93 Difference]: Finished difference Result 897 states and 1082 transitions. [2024-12-02 15:53:33,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-12-02 15:53:33,394 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 7.5) internal successors, (120), 18 states have internal predecessors, (120), 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 124 [2024-12-02 15:53:33,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:53:33,397 INFO L225 Difference]: With dead ends: 897 [2024-12-02 15:53:33,397 INFO L226 Difference]: Without dead ends: 897 [2024-12-02 15:53:33,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2024-12-02 15:53:33,398 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 522 mSDsluCounter, 3060 mSDsCounter, 0 mSdLazyCounter, 2544 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 3377 SdHoareTripleChecker+Invalid, 2569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.5s IncrementalHoareTripleChecker+Time [2024-12-02 15:53:33,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 3377 Invalid, 2569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2544 Invalid, 0 Unknown, 0 Unchecked, 24.5s Time] [2024-12-02 15:53:33,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2024-12-02 15:53:33,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 893. [2024-12-02 15:53:33,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 743 states have (on average 1.4360699865410498) internal successors, (1067), 885 states have internal predecessors, (1067), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-12-02 15:53:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1079 transitions. [2024-12-02 15:53:33,411 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1079 transitions. Word has length 124 [2024-12-02 15:53:33,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:53:33,411 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1079 transitions. [2024-12-02 15:53:33,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 7.5) internal successors, (120), 18 states have internal predecessors, (120), 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-12-02 15:53:33,412 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1079 transitions. [2024-12-02 15:53:33,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-12-02 15:53:33,413 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:53:33,413 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 15:53:33,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-12-02 15:53:33,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2024-12-02 15:53:33,613 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr138REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:53:33,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:53:33,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1154894376, now seen corresponding path program 1 times [2024-12-02 15:53:33,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:53:33,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758777477] [2024-12-02 15:53:33,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:53:33,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:53:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:53:34,019 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 15:53:34,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:53:34,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758777477] [2024-12-02 15:53:34,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758777477] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:53:34,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396017261] [2024-12-02 15:53:34,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:53:34,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:53:34,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:53:34,022 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:53:34,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-12-02 15:53:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:53:34,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-12-02 15:53:34,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:53:37,460 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 15:53:37,461 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-12-02 15:53:37,675 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-12-02 15:53:37,751 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-12-02 15:53:39,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 15:53:39,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 40 [2024-12-02 15:53:39,284 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-12-02 15:53:39,905 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:53:39,906 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-12-02 15:53:39,928 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-12-02 15:53:40,509 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:53:40,510 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-12-02 15:53:40,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-12-02 15:53:41,145 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:53:41,146 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-12-02 15:53:41,169 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-12-02 15:53:41,835 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:53:41,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-12-02 15:53:41,858 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-12-02 15:53:42,567 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:53:42,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 70 treesize of output 65 [2024-12-02 15:53:42,587 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 49 treesize of output 30 [2024-12-02 15:53:43,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-12-02 15:53:43,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 23 treesize of output 11 [2024-12-02 15:53:45,025 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 39 treesize of output 21 [2024-12-02 15:53:45,043 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 32 treesize of output 14 [2024-12-02 15:53:45,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:53:45,340 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 15:53:45,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396017261] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:53:45,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 15:53:45,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [4] total 21 [2024-12-02 15:53:45,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801613304] [2024-12-02 15:53:45,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:53:45,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-12-02 15:53:45,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:53:45,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-12-02 15:53:45,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-12-02 15:53:45,342 INFO L87 Difference]: Start difference. First operand 893 states and 1079 transitions. Second operand has 19 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 19 states have internal predecessors, (120), 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-12-02 15:54:19,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:54:19,494 INFO L93 Difference]: Finished difference Result 922 states and 1109 transitions. [2024-12-02 15:54:19,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-12-02 15:54:19,495 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 19 states have internal predecessors, (120), 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 124 [2024-12-02 15:54:19,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:54:19,499 INFO L225 Difference]: With dead ends: 922 [2024-12-02 15:54:19,499 INFO L226 Difference]: Without dead ends: 922 [2024-12-02 15:54:19,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2024-12-02 15:54:19,500 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 571 mSDsluCounter, 4320 mSDsCounter, 0 mSdLazyCounter, 3874 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 4641 SdHoareTripleChecker+Invalid, 3890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.9s IncrementalHoareTripleChecker+Time [2024-12-02 15:54:19,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 4641 Invalid, 3890 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [16 Valid, 3874 Invalid, 0 Unknown, 0 Unchecked, 30.9s Time] [2024-12-02 15:54:19,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-12-02 15:54:19,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 900. [2024-12-02 15:54:19,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 749 states have (on average 1.4325767690253672) internal successors, (1073), 891 states have internal predecessors, (1073), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-12-02 15:54:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1085 transitions. [2024-12-02 15:54:19,513 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1085 transitions. Word has length 124 [2024-12-02 15:54:19,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:54:19,513 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1085 transitions. [2024-12-02 15:54:19,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 19 states have internal predecessors, (120), 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-12-02 15:54:19,513 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1085 transitions. [2024-12-02 15:54:19,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-12-02 15:54:19,514 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:54:19,515 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 15:54:19,531 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-12-02 15:54:19,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:54:19,715 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:54:19,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:54:19,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1026026702, now seen corresponding path program 1 times [2024-12-02 15:54:19,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:54:19,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752829578] [2024-12-02 15:54:19,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:54:19,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:54:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:54:20,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 15:54:20,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:54:20,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752829578] [2024-12-02 15:54:20,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752829578] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:54:20,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853033468] [2024-12-02 15:54:20,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:54:20,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:54:20,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:54:20,286 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:54:20,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-12-02 15:54:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:54:20,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-12-02 15:54:20,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:54:22,222 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 15:54:22,222 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-12-02 15:54:22,360 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-12-02 15:54:23,393 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:54:23,393 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-12-02 15:54:23,786 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:54:23,787 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-12-02 15:54:24,193 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:54:24,194 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-12-02 15:54:24,645 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:54:24,645 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-12-02 15:54:25,100 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:54:25,101 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-12-02 15:54:25,640 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:54:25,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-12-02 15:54:26,562 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:54:26,562 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-12-02 15:54:26,871 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-12-02 15:54:28,199 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-12-02 15:54:28,522 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:54:28,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:54:30,827 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5068 (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_5068) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-12-02 15:54:30,961 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-12-02 15:54:30,962 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-12-02 15:54:31,006 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5068 (Array Int Int)) (v_ArrVal_5067 (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~mem57#1.base| v_ArrVal_5067))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5068)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem57#1.base|)) is different from false [2024-12-02 15:54:31,325 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5066 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_5066) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-12-02 15:54:32,203 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5065 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~user~0#1.base| (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_5065) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) is different from false [2024-12-02 15:54:32,278 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5065 (Array Int Int)) (v_ArrVal_5064 (Array Int Int))) (not (= (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~mem54#1.base| v_ArrVal_5064))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5065)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-12-02 15:54:36,949 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5065 (Array Int Int)) (v_ArrVal_5064 (Array Int Int)) (v_ArrVal_5063 (Array Int Int))) (not (= (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~mem53#1.base| v_ArrVal_5063))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5064)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5065)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-12-02 15:54:43,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853033468] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:54:43,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 15:54:43,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 18] total 22 [2024-12-02 15:54:43,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530560219] [2024-12-02 15:54:43,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 15:54:43,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-12-02 15:54:43,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:54:43,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-12-02 15:54:43,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=739, Unknown=42, NotChecked=366, Total=1260 [2024-12-02 15:54:43,424 INFO L87 Difference]: Start difference. First operand 900 states and 1085 transitions. Second operand has 22 states, 21 states have (on average 10.857142857142858) internal successors, (228), 22 states have internal predecessors, (228), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-12-02 15:55:14,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:55:14,334 INFO L93 Difference]: Finished difference Result 874 states and 1056 transitions. [2024-12-02 15:55:14,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-12-02 15:55:14,335 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 10.857142857142858) internal successors, (228), 22 states have internal predecessors, (228), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 125 [2024-12-02 15:55:14,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:55:14,338 INFO L225 Difference]: With dead ends: 874 [2024-12-02 15:55:14,338 INFO L226 Difference]: Without dead ends: 870 [2024-12-02 15:55:14,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 134 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=273, Invalid=1953, Unknown=54, NotChecked=582, Total=2862 [2024-12-02 15:55:14,339 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 503 mSDsluCounter, 3106 mSDsCounter, 0 mSdLazyCounter, 2607 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 3423 SdHoareTripleChecker+Invalid, 2633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.6s IncrementalHoareTripleChecker+Time [2024-12-02 15:55:14,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 3423 Invalid, 2633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2607 Invalid, 0 Unknown, 0 Unchecked, 25.6s Time] [2024-12-02 15:55:14,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-12-02 15:55:14,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 866. [2024-12-02 15:55:14,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 718 states have (on average 1.4498607242339834) internal successors, (1041), 859 states have internal predecessors, (1041), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-12-02 15:55:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1049 transitions. [2024-12-02 15:55:14,354 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1049 transitions. Word has length 125 [2024-12-02 15:55:14,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:55:14,354 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1049 transitions. [2024-12-02 15:55:14,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 10.857142857142858) internal successors, (228), 22 states have internal predecessors, (228), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-12-02 15:55:14,354 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1049 transitions. [2024-12-02 15:55:14,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-12-02 15:55:14,355 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:55:14,355 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 15:55:14,366 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-12-02 15:55:14,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:55:14,556 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr138REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:55:14,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:55:14,556 INFO L85 PathProgramCache]: Analyzing trace with hash 84896648, now seen corresponding path program 1 times [2024-12-02 15:55:14,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:55:14,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193087938] [2024-12-02 15:55:14,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:55:14,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:55:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:55:15,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 15:55:15,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:55:15,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193087938] [2024-12-02 15:55:15,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193087938] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:55:15,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236022900] [2024-12-02 15:55:15,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:55:15,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:55:15,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:55:15,284 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:55:15,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-12-02 15:55:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:55:15,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-12-02 15:55:15,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:55:18,875 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 15:55:18,876 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-12-02 15:55:19,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-12-02 15:55:19,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-12-02 15:55:20,832 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:55:20,832 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-12-02 15:55:20,856 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-12-02 15:55:21,483 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:55:21,483 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-12-02 15:55:21,507 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-12-02 15:55:22,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 15:55:22,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 40 [2024-12-02 15:55:22,148 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-12-02 15:55:22,798 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:55:22,799 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-12-02 15:55:22,822 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-12-02 15:55:23,509 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:55:23,509 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-12-02 15:55:23,533 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-12-02 15:55:24,365 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:55:24,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 51 treesize of output 48 [2024-12-02 15:55:24,391 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-12-02 15:55:25,184 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:55:25,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-12-02 15:55:25,211 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-12-02 15:55:26,258 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-12-02 15:55:26,280 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-12-02 15:55:28,081 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-12-02 15:55:28,122 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-12-02 15:55:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 15:55:28,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:55:31,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 15:55:31,551 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 48 treesize of output 52 [2024-12-02 15:55:31,790 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_5294 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem59#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_prenex_89 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_#t~mem59#1.offset| 29))) (forall ((v_ArrVal_5293 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_5293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12))))) is different from false [2024-12-02 15:55:31,892 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_prenex_89 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 29))) (forall ((v_ArrVal_5293 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12))) (forall ((v_ArrVal_5294 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-12-02 15:55:32,071 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_5292))) (< (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 29)))) (forall ((v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_5292) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_5291))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse2 (select (select (store .cse3 .cse2 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-12-02 15:55:32,246 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_5291 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5292) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12))) (forall ((v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5292))) (< (select (select (store .cse2 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 29)))) (forall ((v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5291))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse3 (select (select (store .cse4 .cse3 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-12-02 15:55:32,450 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_5289))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5291)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) (forall ((v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_5289))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse4 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_5290) .cse6 v_ArrVal_5292))) (< (select (select (store .cse4 (select (select (store .cse5 .cse6 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (+ 29 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) (forall ((v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ 12 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_5289))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_5290) .cse7 v_ArrVal_5292) (select (select (store .cse8 .cse7 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5293))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-12-02 15:55:32,592 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |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|) .cse3))) (and (forall ((v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_5289))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_5290) .cse2 v_ArrVal_5292))) (< (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ 29 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) (forall ((v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_5289))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_5290) .cse5 v_ArrVal_5292) (select (select (store .cse6 .cse5 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5293))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 12))) (forall ((v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_5289))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5291)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= .cse7 (select (select (store .cse8 .cse7 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) is different from false [2024-12-02 15:55:32,975 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_5288))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_5289))) (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~mem55#1.base| v_ArrVal_5287) .cse0 v_ArrVal_5290) .cse1 v_ArrVal_5292) (select (select (store .cse2 .cse1 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5293))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 12))) (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_5288))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse9 .cse8 v_ArrVal_5289))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_5287) .cse8 v_ArrVal_5290) .cse7 v_ArrVal_5292))) (< (select (select (store .cse5 (select (select (store .cse6 .cse7 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 29)))))))) (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse10 (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_5288))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5289)))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5291)))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (store .cse10 .cse11 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse11)))))) is different from false [2024-12-02 15:55:33,257 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |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|) .cse3))) (and (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_5288))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store .cse6 .cse5 v_ArrVal_5289))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_5287) .cse5 v_ArrVal_5290) .cse2 v_ArrVal_5292))) (< (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 29)))))))) (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_5288))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_5289))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_5287) .cse7 v_ArrVal_5290) .cse8 v_ArrVal_5292) (select (select (store .cse9 .cse8 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5293))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 12))) (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse11 (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_5288))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5289)))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5291)))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (store .cse11 .cse12 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse12))))))) is different from false [2024-12-02 15:55:33,806 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_main_#t~mem54#1.offset|))) (and (forall ((v_ArrVal_5286 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_5286 .cse1)) v_ArrVal_5286)) (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_5286))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_5288))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_5289))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_5285) .cse2 v_ArrVal_5287) .cse3 v_ArrVal_5290) .cse4 v_ArrVal_5292) (select (select (store .cse5 .cse4 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_5293))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) 12))))) (forall ((v_ArrVal_5286 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_5286 .cse1)) v_ArrVal_5286)) (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_5286))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_5288))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse10 (store .cse14 .cse13 v_ArrVal_5289))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse9 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_5285) .cse12 v_ArrVal_5287) .cse13 v_ArrVal_5290) .cse11 v_ArrVal_5292))) (< (select (select (store .cse9 (select (select (store .cse10 .cse11 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) (+ 29 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))))))) (forall ((v_ArrVal_5286 (Array Int Int))) (or (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse17 (let ((.cse18 (let ((.cse19 (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_5286))) (store .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_5288)))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_5289)))) (store .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_5291)))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (= .cse16 (select (select (store .cse17 .cse16 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))) (not (= (store .cse0 .cse1 (select v_ArrVal_5286 .cse1)) v_ArrVal_5286)))))) is different from false [2024-12-02 15:55:34,082 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |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|) .cse7))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse0 (select |c_#memory_$Pointer$#1.base| .cse2))) (and (forall ((|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int)) (or (forall ((v_ArrVal_5286 (Array Int Int))) (or (not (= v_ArrVal_5286 (let ((.cse1 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store .cse0 .cse1 (select v_ArrVal_5286 .cse1))))) (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ 12 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_5286))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_5288))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse6 (store .cse8 .cse4 v_ArrVal_5289))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_5285) .cse3 v_ArrVal_5287) .cse4 v_ArrVal_5290) .cse5 v_ArrVal_5292) (select (select (store .cse6 .cse5 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) v_ArrVal_5293))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)))))) (< .cse10 |v_ULTIMATE.start_main_#t~mem54#1.offset_35|))) (forall ((|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int)) (or (< .cse10 |v_ULTIMATE.start_main_#t~mem54#1.offset_35|) (forall ((v_ArrVal_5286 (Array Int Int))) (or (not (= v_ArrVal_5286 (let ((.cse11 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store .cse0 .cse11 (select v_ArrVal_5286 .cse11))))) (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse13 (let ((.cse14 (let ((.cse15 (let ((.cse16 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_5286))) (store .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) v_ArrVal_5288)))) (store .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) v_ArrVal_5289)))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) v_ArrVal_5291)))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (= .cse12 (select (select (store .cse13 .cse12 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int)) (or (< .cse10 |v_ULTIMATE.start_main_#t~mem54#1.offset_35|) (forall ((v_ArrVal_5286 (Array Int Int))) (or (not (= v_ArrVal_5286 (let ((.cse17 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store .cse0 .cse17 (select v_ArrVal_5286 .cse17))))) (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_5286))) (let ((.cse21 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse23 (store .cse24 .cse21 v_ArrVal_5288))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse19 (store .cse23 .cse22 v_ArrVal_5289))) (let ((.cse20 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse18 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_5285) .cse21 v_ArrVal_5287) .cse22 v_ArrVal_5290) .cse20 v_ArrVal_5292))) (< (select (select (store .cse18 (select (select (store .cse19 .cse20 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) (+ (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) 29)))))))))))))))))) is different from false [2024-12-02 15:55:35,656 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int) (v_ArrVal_5284 (Array Int Int)) (v_ArrVal_5283 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_5284))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem54#1.offset_35|) (forall ((v_ArrVal_5286 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_5283))) (let ((.cse2 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ 12 (select (select (let ((.cse8 (store .cse9 .cse2 v_ArrVal_5286))) (let ((.cse3 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store .cse8 .cse3 v_ArrVal_5288))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_5289))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store (store .cse0 .cse2 v_ArrVal_5285) .cse3 v_ArrVal_5287) .cse4 v_ArrVal_5290) .cse5 v_ArrVal_5292) (select (select (store .cse6 .cse5 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5293))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (not (= (let ((.cse10 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store (select .cse9 .cse2) .cse10 (select v_ArrVal_5286 .cse10))) v_ArrVal_5286))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int) (v_ArrVal_5284 (Array Int Int)) (v_ArrVal_5283 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_5284))) (or (< (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem54#1.offset_35|) (forall ((v_ArrVal_5286 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_5283))) (let ((.cse15 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse19 (store .cse20 .cse15 v_ArrVal_5286))) (let ((.cse16 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse18 (store .cse19 .cse16 v_ArrVal_5288))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse18 .cse17 v_ArrVal_5289))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse12 (store (store (store (store .cse11 .cse15 v_ArrVal_5285) .cse16 v_ArrVal_5287) .cse17 v_ArrVal_5290) .cse14 v_ArrVal_5292))) (< (select (select (store .cse12 (select (select (store .cse13 .cse14 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 29)))))))))) (not (= (let ((.cse21 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store (select .cse20 .cse15) .cse21 (select v_ArrVal_5286 .cse21))) v_ArrVal_5286))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int) (v_ArrVal_5284 (Array Int Int)) (v_ArrVal_5283 (Array Int Int))) (or (forall ((v_ArrVal_5286 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_5283))) (let ((.cse28 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse23 (let ((.cse24 (let ((.cse25 (let ((.cse26 (store .cse27 .cse28 v_ArrVal_5286))) (store .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5288)))) (store .cse25 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5289)))) (store .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5291)))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse22 (select (select (store .cse23 .cse22 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (not (= (let ((.cse29 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store (select .cse27 .cse28) .cse29 (select v_ArrVal_5286 .cse29))) v_ArrVal_5286)))))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_5284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem54#1.offset_35|))))) is different from false [2024-12-02 15:55:37,011 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int) (v_ArrVal_5284 (Array Int Int)) (v_ArrVal_5283 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_5284))) (or (forall ((v_ArrVal_5286 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_5283))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_5286))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_5288))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store .cse8 .cse7 v_ArrVal_5289))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store (store (store .cse4 .cse5 v_ArrVal_5285) .cse6 v_ArrVal_5287) .cse7 v_ArrVal_5290) .cse2 v_ArrVal_5292))) (< (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ 29 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) (not (= (let ((.cse11 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store (select .cse10 .cse5) .cse11 (select v_ArrVal_5286 .cse11))) v_ArrVal_5286)))))) (< (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) |v_ULTIMATE.start_main_#t~mem54#1.offset_35|)))) (forall ((|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int) (v_ArrVal_5284 (Array Int Int)) (v_ArrVal_5283 (Array Int Int))) (or (forall ((v_ArrVal_5286 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_5283))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (not (= (let ((.cse15 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store (select .cse13 .cse14) .cse15 (select v_ArrVal_5286 .cse15))) v_ArrVal_5286)) (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse16 (let ((.cse18 (let ((.cse19 (let ((.cse20 (store .cse13 .cse14 v_ArrVal_5286))) (store .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5288)))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5289)))) (store .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5291)))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (= (select (select (store .cse16 .cse17 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) .cse17)))))))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_5284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) |v_ULTIMATE.start_main_#t~mem54#1.offset_35|))) (forall ((|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int) (v_ArrVal_5284 (Array Int Int)) (v_ArrVal_5283 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$#1.offset| .cse12 v_ArrVal_5284))) (or (< (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) |v_ULTIMATE.start_main_#t~mem54#1.offset_35|) (forall ((v_ArrVal_5286 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$#1.base| .cse12 v_ArrVal_5283))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (not (= (let ((.cse24 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store (select .cse22 .cse23) .cse24 (select v_ArrVal_5286 .cse24))) v_ArrVal_5286)) (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse30 (store .cse22 .cse23 v_ArrVal_5286))) (let ((.cse25 (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse29 (store .cse30 .cse25 v_ArrVal_5288))) (let ((.cse26 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse28 (store .cse29 .cse26 v_ArrVal_5289))) (let ((.cse27 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store (store .cse21 .cse23 v_ArrVal_5285) .cse25 v_ArrVal_5287) .cse26 v_ArrVal_5290) .cse27 v_ArrVal_5292) (select (select (store .cse28 .cse27 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5293))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 12))))))))))))) is different from false [2024-12-02 15:55:41,983 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_5301 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int) (v_ArrVal_5302 (Array Int Int)) (v_ArrVal_5284 (Array Int Int)) (v_ArrVal_5283 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_5302))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_5301) .cse13 v_ArrVal_5284))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem54#1.offset_35|) (forall ((v_ArrVal_5286 (Array Int Int))) (let ((.cse10 (store .cse12 .cse13 v_ArrVal_5283))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_5286))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_5288))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse3 (store .cse8 .cse7 v_ArrVal_5289))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store (store (store (store .cse0 .cse5 v_ArrVal_5285) .cse6 v_ArrVal_5287) .cse7 v_ArrVal_5290) .cse4 v_ArrVal_5292))) (< (select (select (store .cse2 (select (select (store .cse3 .cse4 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_89) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ 29 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (not (= v_ArrVal_5286 (let ((.cse11 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store (select .cse10 .cse5) .cse11 (select v_ArrVal_5286 .cse11)))))))))))))) (forall ((v_ArrVal_5301 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int) (v_ArrVal_5302 (Array Int Int)) (v_ArrVal_5284 (Array Int Int)) (v_ArrVal_5283 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_5302))) (let ((.cse14 (select (select .cse23 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_5301) .cse14 v_ArrVal_5284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem54#1.offset_35|) (forall ((v_ArrVal_5286 (Array Int Int))) (let ((.cse15 (store .cse23 .cse14 v_ArrVal_5283))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (= v_ArrVal_5286 (let ((.cse17 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store (select .cse15 .cse16) .cse17 (select v_ArrVal_5286 .cse17))))) (forall ((v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5294 (Array Int Int))) (let ((.cse18 (let ((.cse20 (let ((.cse21 (let ((.cse22 (store .cse15 .cse16 v_ArrVal_5286))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5288)))) (store .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5289)))) (store .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5291)))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (store .cse18 .cse19 v_ArrVal_5294) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse19)))))))))))) (forall ((v_ArrVal_5301 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem54#1.offset_35| Int) (v_ArrVal_5302 (Array Int Int)) (v_ArrVal_5284 (Array Int Int)) (v_ArrVal_5283 (Array Int Int))) (let ((.cse34 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_5302))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse27 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_5301) .cse35 v_ArrVal_5284))) (or (forall ((v_ArrVal_5286 (Array Int Int))) (let ((.cse24 (store .cse34 .cse35 v_ArrVal_5283))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (= v_ArrVal_5286 (let ((.cse26 (+ |v_ULTIMATE.start_main_#t~mem54#1.offset_35| 4))) (store (select .cse24 .cse25) .cse26 (select v_ArrVal_5286 .cse26))))) (forall ((v_ArrVal_5285 (Array Int Int)) (v_ArrVal_5288 (Array Int Int)) (v_ArrVal_5287 (Array Int Int)) (v_ArrVal_5289 (Array Int Int)) (v_ArrVal_5291 (Array Int Int)) (v_ArrVal_5290 (Array Int Int)) (v_ArrVal_5293 (Array Int Int)) (v_ArrVal_5292 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse33 (store .cse24 .cse25 v_ArrVal_5286))) (let ((.cse28 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse32 (store .cse33 .cse28 v_ArrVal_5288))) (let ((.cse29 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse31 (store .cse32 .cse29 v_ArrVal_5289))) (let ((.cse30 (select (select .cse31 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store (store (store (store .cse27 .cse25 v_ArrVal_5285) .cse28 v_ArrVal_5287) .cse29 v_ArrVal_5290) .cse30 v_ArrVal_5292) (select (select (store .cse31 .cse30 v_ArrVal_5291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5293))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12))))))) (< (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~mem54#1.offset_35|)))))))) is different from false [2024-12-02 15:55:42,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236022900] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:55:42,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 15:55:42,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19] total 24 [2024-12-02 15:55:42,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552074408] [2024-12-02 15:55:42,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 15:55:42,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-12-02 15:55:42,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:55:42,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-12-02 15:55:42,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=684, Unknown=13, NotChecked=832, Total=1640 [2024-12-02 15:55:42,005 INFO L87 Difference]: Start difference. First operand 866 states and 1049 transitions. Second operand has 24 states, 23 states have (on average 10.434782608695652) internal successors, (240), 24 states have internal predecessors, (240), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-12-02 15:56:17,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:56:17,988 INFO L93 Difference]: Finished difference Result 876 states and 1058 transitions. [2024-12-02 15:56:17,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-12-02 15:56:17,989 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 10.434782608695652) internal successors, (240), 24 states have internal predecessors, (240), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 126 [2024-12-02 15:56:17,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:56:17,992 INFO L225 Difference]: With dead ends: 876 [2024-12-02 15:56:17,992 INFO L226 Difference]: Without dead ends: 874 [2024-12-02 15:56:17,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=289, Invalid=2102, Unknown=13, NotChecked=1378, Total=3782 [2024-12-02 15:56:17,993 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 891 mSDsluCounter, 3526 mSDsCounter, 0 mSdLazyCounter, 3016 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 3847 SdHoareTripleChecker+Invalid, 3035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.9s IncrementalHoareTripleChecker+Time [2024-12-02 15:56:17,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 3847 Invalid, 3035 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [19 Valid, 3016 Invalid, 0 Unknown, 0 Unchecked, 29.9s Time] [2024-12-02 15:56:17,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-12-02 15:56:18,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-12-02 15:56:18,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 725 states have (on average 1.4455172413793103) internal successors, (1048), 866 states have internal predecessors, (1048), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-12-02 15:56:18,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1056 transitions. [2024-12-02 15:56:18,004 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1056 transitions. Word has length 126 [2024-12-02 15:56:18,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:56:18,004 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1056 transitions. [2024-12-02 15:56:18,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 10.434782608695652) internal successors, (240), 24 states have internal predecessors, (240), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-12-02 15:56:18,004 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1056 transitions. [2024-12-02 15:56:18,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-12-02 15:56:18,005 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:56:18,005 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 15:56:18,016 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-12-02 15:56:18,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:56:18,206 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:56:18,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:56:18,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1224414959, now seen corresponding path program 2 times [2024-12-02 15:56:18,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:56:18,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555152920] [2024-12-02 15:56:18,207 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 15:56:18,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:56:18,254 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 15:56:18,254 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 15:56:19,168 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-02 15:56:19,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:56:19,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555152920] [2024-12-02 15:56:19,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555152920] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:56:19,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:56:19,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 15:56:19,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620764175] [2024-12-02 15:56:19,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:56:19,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:56:19,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:56:19,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:56:19,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:56:19,170 INFO L87 Difference]: Start difference. First operand 874 states and 1056 transitions. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 15:56:22,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:56:22,821 INFO L93 Difference]: Finished difference Result 894 states and 1080 transitions. [2024-12-02 15:56:22,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:56:22,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 128 [2024-12-02 15:56:22,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:56:22,824 INFO L225 Difference]: With dead ends: 894 [2024-12-02 15:56:22,824 INFO L226 Difference]: Without dead ends: 894 [2024-12-02 15:56:22,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-12-02 15:56:22,825 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 9 mSDsluCounter, 1743 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-12-02 15:56:22,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2254 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-12-02 15:56:22,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-12-02 15:56:22,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 882. [2024-12-02 15:56:22,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 733 states have (on average 1.4351978171896316) internal successors, (1052), 874 states have internal predecessors, (1052), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-12-02 15:56:22,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1060 transitions. [2024-12-02 15:56:22,836 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1060 transitions. Word has length 128 [2024-12-02 15:56:22,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:56:22,837 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1060 transitions. [2024-12-02 15:56:22,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 15:56:22,837 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1060 transitions. [2024-12-02 15:56:22,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-02 15:56:22,838 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:56:22,838 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 15:56:22,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-12-02 15:56:22,838 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:56:22,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:56:22,839 INFO L85 PathProgramCache]: Analyzing trace with hash -276010185, now seen corresponding path program 1 times [2024-12-02 15:56:22,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:56:22,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088527323] [2024-12-02 15:56:22,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:56:22,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:56:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:56:23,569 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-02 15:56:23,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:56:23,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088527323] [2024-12-02 15:56:23,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088527323] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:56:23,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:56:23,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 15:56:23,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850056535] [2024-12-02 15:56:23,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:56:23,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 15:56:23,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:56:23,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 15:56:23,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 15:56:23,570 INFO L87 Difference]: Start difference. First operand 882 states and 1060 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 15:56:26,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:56:26,564 INFO L93 Difference]: Finished difference Result 902 states and 1084 transitions. [2024-12-02 15:56:26,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 15:56:26,565 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 129 [2024-12-02 15:56:26,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:56:26,567 INFO L225 Difference]: With dead ends: 902 [2024-12-02 15:56:26,567 INFO L226 Difference]: Without dead ends: 902 [2024-12-02 15:56:26,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 15:56:26,568 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 10 mSDsluCounter, 2201 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2706 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-12-02 15:56:26,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2706 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-12-02 15:56:26,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-12-02 15:56:26,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 898. [2024-12-02 15:56:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 749 states have (on average 1.431241655540721) internal successors, (1072), 890 states have internal predecessors, (1072), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-12-02 15:56:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1080 transitions. [2024-12-02 15:56:26,581 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1080 transitions. Word has length 129 [2024-12-02 15:56:26,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:56:26,582 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1080 transitions. [2024-12-02 15:56:26,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 15:56:26,582 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1080 transitions. [2024-12-02 15:56:26,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-02 15:56:26,583 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:56:26,583 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 15:56:26,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-12-02 15:56:26,583 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:56:26,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:56:26,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1619411060, now seen corresponding path program 1 times [2024-12-02 15:56:26,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:56:26,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783073290] [2024-12-02 15:56:26,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:56:26,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:56:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:56:27,118 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-02 15:56:27,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:56:27,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783073290] [2024-12-02 15:56:27,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783073290] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:56:27,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:56:27,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 15:56:27,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536875410] [2024-12-02 15:56:27,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:56:27,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:56:27,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:56:27,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:56:27,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:56:27,120 INFO L87 Difference]: Start difference. First operand 898 states and 1080 transitions. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 15:56:29,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:56:29,594 INFO L93 Difference]: Finished difference Result 910 states and 1092 transitions. [2024-12-02 15:56:29,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:56:29,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 130 [2024-12-02 15:56:29,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:56:29,597 INFO L225 Difference]: With dead ends: 910 [2024-12-02 15:56:29,597 INFO L226 Difference]: Without dead ends: 910 [2024-12-02 15:56:29,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:56:29,598 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 4 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2277 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-12-02 15:56:29,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2277 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-12-02 15:56:29,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-12-02 15:56:29,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 910. [2024-12-02 15:56:29,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 761 states have (on average 1.4244415243101183) internal successors, (1084), 902 states have internal predecessors, (1084), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-12-02 15:56:29,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1092 transitions. [2024-12-02 15:56:29,606 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1092 transitions. Word has length 130 [2024-12-02 15:56:29,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:56:29,606 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1092 transitions. [2024-12-02 15:56:29,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 15:56:29,606 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1092 transitions. [2024-12-02 15:56:29,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-02 15:56:29,607 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:56:29,607 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 15:56:29,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-12-02 15:56:29,607 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:56:29,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:56:29,608 INFO L85 PathProgramCache]: Analyzing trace with hash 669432667, now seen corresponding path program 1 times [2024-12-02 15:56:29,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:56:29,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237710818] [2024-12-02 15:56:29,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:56:29,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:56:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:56:30,713 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-02 15:56:30,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:56:30,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237710818] [2024-12-02 15:56:30,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237710818] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:56:30,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:56:30,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 15:56:30,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959867490] [2024-12-02 15:56:30,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:56:30,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 15:56:30,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:56:30,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 15:56:30,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-12-02 15:56:30,714 INFO L87 Difference]: Start difference. First operand 910 states and 1092 transitions. Second operand has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 15:56:35,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:56:35,141 INFO L93 Difference]: Finished difference Result 962 states and 1164 transitions. [2024-12-02 15:56:35,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 15:56:35,142 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 130 [2024-12-02 15:56:35,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:56:35,144 INFO L225 Difference]: With dead ends: 962 [2024-12-02 15:56:35,144 INFO L226 Difference]: Without dead ends: 962 [2024-12-02 15:56:35,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-12-02 15:56:35,144 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 30 mSDsluCounter, 3151 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3657 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-12-02 15:56:35,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3657 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-12-02 15:56:35,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-12-02 15:56:35,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 950. [2024-12-02 15:56:35,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 801 states have (on average 1.4232209737827715) internal successors, (1140), 942 states have internal predecessors, (1140), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-12-02 15:56:35,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1148 transitions. [2024-12-02 15:56:35,156 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1148 transitions. Word has length 130 [2024-12-02 15:56:35,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:56:35,156 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1148 transitions. [2024-12-02 15:56:35,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 15:56:35,156 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1148 transitions. [2024-12-02 15:56:35,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-02 15:56:35,157 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:56:35,157 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 15:56:35,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-12-02 15:56:35,157 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:56:35,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:56:35,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1056049972, now seen corresponding path program 1 times [2024-12-02 15:56:35,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:56:35,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707870907] [2024-12-02 15:56:35,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:56:35,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:56:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:56:35,803 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 15:56:35,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:56:35,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707870907] [2024-12-02 15:56:35,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707870907] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:56:35,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482014956] [2024-12-02 15:56:35,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:56:35,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:56:35,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:56:35,807 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:56:35,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-12-02 15:56:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:56:36,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-12-02 15:56:36,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:56:36,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-02 15:56:40,005 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 15:56:40,005 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-12-02 15:56:40,065 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-12-02 15:56:40,326 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-12-02 15:56:40,374 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-12-02 15:56:40,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-12-02 15:56:41,223 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 10 treesize of output 4 [2024-12-02 15:56:42,196 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset#1_#t~loopctr160_83| Int) (|v_#Ultimate.C_memset#1_#t~loopctr160_82| Int)) (and (<= |v_#Ultimate.C_memset#1_#t~loopctr160_83| (+ |v_#Ultimate.C_memset#1_#t~loopctr160_82| 1)) (<= |v_#Ultimate.C_memset#1_#t~loopctr160_82| 0) (<= |c_#Ultimate.C_memset#1_#t~loopctr160| (+ |v_#Ultimate.C_memset#1_#t~loopctr160_83| 1)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_#Ultimate.C_memset#1_#ptr.base| (store (store (select |c_old(#memory_$Pointer$#1.base)| |c_#Ultimate.C_memset#1_#ptr.base|) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_82| |c_#Ultimate.C_memset#1_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_83| |c_#Ultimate.C_memset#1_#ptr.offset|) 0))))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26|) 1) (<= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26|) 40)))) is different from true [2024-12-02 15:56:42,316 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset#1_#t~loopctr160_83| Int) (|v_#Ultimate.C_memset#1_#t~loopctr160_84| Int) (|v_#Ultimate.C_memset#1_#t~loopctr160_82| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_#Ultimate.C_memset#1_#ptr.base| (store (store (store (select |c_old(#memory_$Pointer$#1.base)| |c_#Ultimate.C_memset#1_#ptr.base|) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_82| |c_#Ultimate.C_memset#1_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_83| |c_#Ultimate.C_memset#1_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_84| |c_#Ultimate.C_memset#1_#ptr.offset|) 0))) (<= |v_#Ultimate.C_memset#1_#t~loopctr160_83| (+ |v_#Ultimate.C_memset#1_#t~loopctr160_82| 1)) (<= |v_#Ultimate.C_memset#1_#t~loopctr160_82| 0) (<= |v_#Ultimate.C_memset#1_#t~loopctr160_84| (+ |v_#Ultimate.C_memset#1_#t~loopctr160_83| 1)))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26|) 1) (<= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26|) 40)))) is different from true [2024-12-02 15:56:42,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 15:56:42,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 15:56:42,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 15:56:42,927 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2024-12-02 15:56:42,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 44 [2024-12-02 15:56:44,570 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-12-02 15:56:44,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 62 [2024-12-02 15:56:45,650 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:56:45,650 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-12-02 15:56:46,521 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:56:46,521 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-12-02 15:56:47,344 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:56:47,344 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-12-02 15:56:48,435 INFO L349 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2024-12-02 15:56:48,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 31 [2024-12-02 15:56:48,477 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-12-02 15:56:48,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2024-12-02 15:56:48,968 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:56:48,968 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-12-02 15:56:50,021 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:56:50,021 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-12-02 15:56:51,405 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-12-02 15:56:51,455 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-12-02 15:56:53,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 15:56:53,269 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 23 [2024-12-02 15:56:53,778 INFO L349 Elim1Store]: treesize reduction 12, result has 75.5 percent of original size [2024-12-02 15:56:53,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 49 [2024-12-02 15:56:54,761 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-12-02 15:56:55,119 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2024-12-02 15:56:55,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:56:56,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482014956] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:56:56,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 15:56:56,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 30] total 36 [2024-12-02 15:56:56,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926498548] [2024-12-02 15:56:56,820 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 15:56:56,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-12-02 15:56:56,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:56:56,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-12-02 15:56:56,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1252, Unknown=3, NotChecked=146, Total=1560 [2024-12-02 15:56:56,822 INFO L87 Difference]: Start difference. First operand 950 states and 1148 transitions. Second operand has 36 states, 35 states have (on average 7.085714285714285) internal successors, (248), 35 states have internal predecessors, (248), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-12-02 15:57:05,954 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset#1_#t~loopctr160_83| Int) (|v_#Ultimate.C_memset#1_#t~loopctr160_84| Int) (|v_#Ultimate.C_memset#1_#t~loopctr160_82| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_#Ultimate.C_memset#1_#ptr.base| (store (store (store (select |c_old(#memory_$Pointer$#1.base)| |c_#Ultimate.C_memset#1_#ptr.base|) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_82| |c_#Ultimate.C_memset#1_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_83| |c_#Ultimate.C_memset#1_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_84| |c_#Ultimate.C_memset#1_#ptr.offset|) 0))) (<= |v_#Ultimate.C_memset#1_#t~loopctr160_83| (+ |v_#Ultimate.C_memset#1_#t~loopctr160_82| 1)) (<= |v_#Ultimate.C_memset#1_#t~loopctr160_82| 0) (<= |v_#Ultimate.C_memset#1_#t~loopctr160_84| (+ |v_#Ultimate.C_memset#1_#t~loopctr160_83| 1)))) (or (not (= |c_#Ultimate.C_memset#1_#amount| 44)) (and (<= 0 (div |c_#Ultimate.C_memset#1_#t~loopctr160| 4294967296)) (<= |c_#Ultimate.C_memset#1_#t~loopctr160| 3))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26|) 1) (<= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26|) 40)))) is different from true [2024-12-02 15:57:05,979 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_#Ultimate.C_memset#1_#amount| 44)) (exists ((|v_#Ultimate.C_memset#1_#t~loopctr160_83| Int) (|v_#Ultimate.C_memset#1_#t~loopctr160_84| Int) (|v_#Ultimate.C_memset#1_#t~loopctr160_82| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_#Ultimate.C_memset#1_#ptr.base| (store (store (store (select |c_old(#memory_$Pointer$#1.base)| |c_#Ultimate.C_memset#1_#ptr.base|) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_82| |c_#Ultimate.C_memset#1_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_83| |c_#Ultimate.C_memset#1_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset#1_#t~loopctr160_84| |c_#Ultimate.C_memset#1_#ptr.offset|) 0))) (<= |v_#Ultimate.C_memset#1_#t~loopctr160_83| (+ |v_#Ultimate.C_memset#1_#t~loopctr160_82| 1)) (<= |v_#Ultimate.C_memset#1_#t~loopctr160_82| 0) (<= |v_#Ultimate.C_memset#1_#t~loopctr160_84| (+ |v_#Ultimate.C_memset#1_#t~loopctr160_83| 1)))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26|) 1) (<= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26|) 40)))) is different from true [2024-12-02 15:58:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:58:06,195 INFO L93 Difference]: Finished difference Result 958 states and 1160 transitions. [2024-12-02 15:58:06,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-12-02 15:58:06,196 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 7.085714285714285) internal successors, (248), 35 states have internal predecessors, (248), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 130 [2024-12-02 15:58:06,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:58:06,198 INFO L225 Difference]: With dead ends: 958 [2024-12-02 15:58:06,199 INFO L226 Difference]: Without dead ends: 956 [2024-12-02 15:58:06,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=233, Invalid=2033, Unknown=6, NotChecked=380, Total=2652 [2024-12-02 15:58:06,199 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 877 mSDsluCounter, 4890 mSDsCounter, 0 mSdLazyCounter, 6479 mSolverCounterSat, 26 mSolverCounterUnsat, 64 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 5140 SdHoareTripleChecker+Invalid, 7887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 6479 IncrementalHoareTripleChecker+Invalid, 64 IncrementalHoareTripleChecker+Unknown, 1318 IncrementalHoareTripleChecker+Unchecked, 61.7s IncrementalHoareTripleChecker+Time [2024-12-02 15:58:06,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 5140 Invalid, 7887 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 6479 Invalid, 64 Unknown, 1318 Unchecked, 61.7s Time] [2024-12-02 15:58:06,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2024-12-02 15:58:06,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 951. [2024-12-02 15:58:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 802 states have (on average 1.4226932668329177) internal successors, (1141), 943 states have internal predecessors, (1141), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-12-02 15:58:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1149 transitions. [2024-12-02 15:58:06,211 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1149 transitions. Word has length 130 [2024-12-02 15:58:06,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:58:06,212 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1149 transitions. [2024-12-02 15:58:06,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 7.085714285714285) internal successors, (248), 35 states have internal predecessors, (248), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-12-02 15:58:06,212 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1149 transitions. [2024-12-02 15:58:06,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-12-02 15:58:06,213 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:58:06,213 INFO L218 NwaCegarLoop]: trace histogram [5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 15:58:06,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-12-02 15:58:06,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2024-12-02 15:58:06,413 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:58:06,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:58:06,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1200425259, now seen corresponding path program 2 times [2024-12-02 15:58:06,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:58:06,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498110462] [2024-12-02 15:58:06,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 15:58:06,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:58:06,469 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 15:58:06,469 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 15:58:07,892 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-02 15:58:07,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:58:07,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498110462] [2024-12-02 15:58:07,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498110462] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:58:07,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:58:07,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 15:58:07,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222030615] [2024-12-02 15:58:07,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:58:07,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 15:58:07,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:58:07,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 15:58:07,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-12-02 15:58:07,895 INFO L87 Difference]: Start difference. First operand 951 states and 1149 transitions. Second operand has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 15:58:12,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:58:12,784 INFO L93 Difference]: Finished difference Result 963 states and 1161 transitions. [2024-12-02 15:58:12,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 15:58:12,785 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 131 [2024-12-02 15:58:12,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:58:12,787 INFO L225 Difference]: With dead ends: 963 [2024-12-02 15:58:12,787 INFO L226 Difference]: Without dead ends: 963 [2024-12-02 15:58:12,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-12-02 15:58:12,788 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 23 mSDsluCounter, 2250 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2760 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-12-02 15:58:12,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2760 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-12-02 15:58:12,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-12-02 15:58:12,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2024-12-02 15:58:12,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 814 states have (on average 1.4164619164619165) internal successors, (1153), 955 states have internal predecessors, (1153), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-12-02 15:58:12,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1161 transitions. [2024-12-02 15:58:12,802 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1161 transitions. Word has length 131 [2024-12-02 15:58:12,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:58:12,802 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1161 transitions. [2024-12-02 15:58:12,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-12-02 15:58:12,802 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1161 transitions. [2024-12-02 15:58:12,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-02 15:58:12,803 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:58:12,803 INFO L218 NwaCegarLoop]: trace histogram [5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 15:58:12,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-12-02 15:58:12,803 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:58:12,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:58:12,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1241471141, now seen corresponding path program 1 times [2024-12-02 15:58:12,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:58:12,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949565520] [2024-12-02 15:58:12,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:58:12,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:58:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:58:14,241 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 15:58:14,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:58:14,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949565520] [2024-12-02 15:58:14,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949565520] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:58:14,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248609856] [2024-12-02 15:58:14,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:58:14,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:58:14,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:58:14,244 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:58:14,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-12-02 15:58:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:58:14,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-12-02 15:58:14,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:58:16,798 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 15:58:16,798 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-12-02 15:58:17,112 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-12-02 15:58:17,971 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 10 treesize of output 4 [2024-12-02 15:58:19,259 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:58:19,259 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-12-02 15:58:20,192 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:58:20,193 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-12-02 15:58:20,209 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 20 treesize of output 1 [2024-12-02 15:58:20,866 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:58:20,867 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-12-02 15:58:20,893 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 20 treesize of output 1 [2024-12-02 15:58:21,583 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:58:21,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-12-02 15:58:21,612 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 20 treesize of output 1 [2024-12-02 15:58:22,318 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:58:22,319 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-12-02 15:58:22,344 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 20 treesize of output 1 [2024-12-02 15:58:23,146 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 15:58:23,147 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-12-02 15:58:23,783 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-12-02 15:58:23,784 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 107 treesize of output 67 [2024-12-02 15:58:23,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 24 [2024-12-02 15:58:25,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 15:58:25,185 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-12-02 15:58:25,186 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 99 treesize of output 62 [2024-12-02 15:58:25,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 24 [2024-12-02 15:58:25,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-12-02 15:58:26,958 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-12-02 15:58:26,958 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 36 treesize of output 17 [2024-12-02 15:58:27,881 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-12-02 15:58:27,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 59 [2024-12-02 15:58:27,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2024-12-02 15:58:29,357 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-12-02 15:58:29,947 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-02 15:58:29,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:58:32,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248609856] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:58:32,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 15:58:32,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 21] total 28 [2024-12-02 15:58:32,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848541580] [2024-12-02 15:58:32,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 15:58:32,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-12-02 15:58:32,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:58:32,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-12-02 15:58:32,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=890, Unknown=10, NotChecked=0, Total=992 [2024-12-02 15:58:32,808 INFO L87 Difference]: Start difference. First operand 963 states and 1161 transitions. Second operand has 28 states, 26 states have (on average 9.038461538461538) internal successors, (235), 28 states have internal predecessors, (235), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-12-02 15:59:09,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:59:09,289 INFO L93 Difference]: Finished difference Result 979 states and 1181 transitions. [2024-12-02 15:59:09,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-12-02 15:59:09,290 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 9.038461538461538) internal successors, (235), 28 states have internal predecessors, (235), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 132 [2024-12-02 15:59:09,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:59:09,292 INFO L225 Difference]: With dead ends: 979 [2024-12-02 15:59:09,292 INFO L226 Difference]: Without dead ends: 977 [2024-12-02 15:59:09,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=255, Invalid=2596, Unknown=11, NotChecked=0, Total=2862 [2024-12-02 15:59:09,293 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 468 mSDsluCounter, 4345 mSDsCounter, 0 mSdLazyCounter, 3636 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 4660 SdHoareTripleChecker+Invalid, 3658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.1s IncrementalHoareTripleChecker+Time [2024-12-02 15:59:09,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 4660 Invalid, 3658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 3636 Invalid, 0 Unknown, 0 Unchecked, 30.1s Time] [2024-12-02 15:59:09,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-12-02 15:59:09,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2024-12-02 15:59:09,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 822 states have (on average 1.4184914841849148) internal successors, (1166), 963 states have internal predecessors, (1166), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-12-02 15:59:09,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1174 transitions. [2024-12-02 15:59:09,302 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1174 transitions. Word has length 132 [2024-12-02 15:59:09,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:59:09,303 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1174 transitions. [2024-12-02 15:59:09,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 9.038461538461538) internal successors, (235), 28 states have internal predecessors, (235), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-12-02 15:59:09,303 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1174 transitions. [2024-12-02 15:59:09,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-02 15:59:09,303 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:59:09,303 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 15:59:09,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-12-02 15:59:09,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2024-12-02 15:59:09,504 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr138REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-12-02 15:59:09,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:59:09,504 INFO L85 PathProgramCache]: Analyzing trace with hash -32735025, now seen corresponding path program 1 times [2024-12-02 15:59:09,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:59:09,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774005759] [2024-12-02 15:59:09,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:59:09,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:59:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:59:10,573 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-02 15:59:10,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:59:10,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774005759] [2024-12-02 15:59:10,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774005759] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 15:59:10,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354856049] [2024-12-02 15:59:10,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:59:10,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:59:10,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:59:10,577 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:59:10,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04322d36-d60c-444c-abc2-17d9106bea27/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-12-02 15:59:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:59:11,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-12-02 15:59:11,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:59:12,182 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-12-02 15:59:12,326 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-12-02 15:59:12,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-12-02 15:59:12,562 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-12-02 15:59:12,619 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-12-02 15:59:13,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-12-02 15:59:13,413 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-12-02 15:59:14,875 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:59:14,876 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-12-02 15:59:14,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-12-02 15:59:15,741 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:59:15,742 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-12-02 15:59:15,786 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-12-02 15:59:16,800 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:59:16,801 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-12-02 15:59:16,832 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-12-02 15:59:17,883 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:59:17,884 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-12-02 15:59:17,934 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-12-02 15:59:19,014 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-12-02 15:59:19,015 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-12-02 15:59:19,070 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-12-02 15:59:20,302 INFO L349 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2024-12-02 15:59:20,303 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 1 case distinctions, treesize of input 20 treesize of output 25 [2024-12-02 15:59:20,626 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-12-02 15:59:20,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2024-12-02 15:59:21,503 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-12-02 15:59:21,503 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 109 treesize of output 57 [2024-12-02 15:59:21,534 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-12-02 15:59:23,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 15:59:23,233 INFO L349 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2024-12-02 15:59:23,233 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 60 [2024-12-02 15:59:23,281 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