./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC --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-6497de0 [2024-11-24 02:06:05,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 02:06:05,690 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-24 02:06:05,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 02:06:05,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 02:06:05,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 02:06:05,741 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 02:06:05,741 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 02:06:05,742 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 02:06:05,742 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 02:06:05,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 02:06:05,743 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 02:06:05,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 02:06:05,744 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 02:06:05,744 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 02:06:05,745 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 02:06:05,745 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 02:06:05,745 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 02:06:05,745 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 02:06:05,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 02:06:05,746 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-24 02:06:05,746 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-24 02:06:05,746 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-24 02:06:05,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 02:06:05,746 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-24 02:06:05,746 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-24 02:06:05,746 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 02:06:05,746 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 02:06:05,747 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 02:06:05,747 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 02:06:05,747 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 02:06:05,747 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 02:06:05,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 02:06:05,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 02:06:05,748 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 02:06:05,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 02:06:05,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 02:06:05,749 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 02:06:05,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 02:06:05,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 02:06:05,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 02:06:05,749 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 02:06:05,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 02:06:05,749 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 02:06:05,750 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 02:06:05,750 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 02:06:05,750 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 02:06:05,750 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_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC 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-11-24 02:06:06,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 02:06:06,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 02:06:06,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 02:06:06,098 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 02:06:06,098 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 02:06:06,100 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-1.i [2024-11-24 02:06:09,156 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/data/a045024e8/b08bca4082df4ae1918ca60cac94efaa/FLAG6a7b54e58 [2024-11-24 02:06:09,622 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 02:06:09,623 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-1.i [2024-11-24 02:06:09,648 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/data/a045024e8/b08bca4082df4ae1918ca60cac94efaa/FLAG6a7b54e58 [2024-11-24 02:06:09,676 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/data/a045024e8/b08bca4082df4ae1918ca60cac94efaa [2024-11-24 02:06:09,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 02:06:09,681 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 02:06:09,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 02:06:09,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 02:06:09,690 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 02:06:09,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 02:06:09" (1/1) ... [2024-11-24 02:06:09,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f5375a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:09, skipping insertion in model container [2024-11-24 02:06:09,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 02:06:09" (1/1) ... [2024-11-24 02:06:09,764 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 02:06:10,355 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-24 02:06:10,426 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-24 02:06:10,431 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-24 02:06:10,436 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-24 02:06:10,446 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-24 02:06:10,464 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-24 02:06:10,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 02:06:10,489 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 02:06:10,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 02:06:10,640 INFO L204 MainTranslator]: Completed translation [2024-11-24 02:06:10,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:10 WrapperNode [2024-11-24 02:06:10,642 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 02:06:10,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 02:06:10,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 02:06:10,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 02:06:10,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:10" (1/1) ... [2024-11-24 02:06:10,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:10" (1/1) ... [2024-11-24 02:06:10,781 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 787 [2024-11-24 02:06:10,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 02:06:10,786 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 02:06:10,786 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 02:06:10,786 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 02:06:10,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:10" (1/1) ... [2024-11-24 02:06:10,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:10" (1/1) ... [2024-11-24 02:06:10,816 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:10" (1/1) ... [2024-11-24 02:06:10,904 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-11-24 02:06:10,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:10" (1/1) ... [2024-11-24 02:06:10,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:10" (1/1) ... [2024-11-24 02:06:10,957 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:10" (1/1) ... [2024-11-24 02:06:10,958 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:10" (1/1) ... [2024-11-24 02:06:10,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:10" (1/1) ... [2024-11-24 02:06:10,982 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:10" (1/1) ... [2024-11-24 02:06:10,989 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:10" (1/1) ... [2024-11-24 02:06:11,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 02:06:11,004 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 02:06:11,005 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 02:06:11,005 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 02:06:11,006 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:10" (1/1) ... [2024-11-24 02:06:11,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 02:06:11,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:06:11,051 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 02:06:11,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 02:06:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-24 02:06:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-24 02:06:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-24 02:06:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-24 02:06:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-24 02:06:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-24 02:06:11,090 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-24 02:06:11,090 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-24 02:06:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-24 02:06:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 02:06:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-24 02:06:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-24 02:06:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-24 02:06:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-24 02:06:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-24 02:06:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 02:06:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-24 02:06:11,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 02:06:11,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 02:06:11,356 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 02:06:11,359 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 02:06:11,363 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-24 02:06:11,411 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-24 02:06:13,686 INFO L? ?]: Removed 762 outVars from TransFormulas that were not future-live. [2024-11-24 02:06:13,686 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 02:06:13,734 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 02:06:13,738 INFO L312 CfgBuilder]: Removed 18 assume(true) statements. [2024-11-24 02:06:13,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 02:06:13 BoogieIcfgContainer [2024-11-24 02:06:13,739 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 02:06:13,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 02:06:13,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 02:06:13,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 02:06:13,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 02:06:09" (1/3) ... [2024-11-24 02:06:13,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@763a53df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 02:06:13, skipping insertion in model container [2024-11-24 02:06:13,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:10" (2/3) ... [2024-11-24 02:06:13,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@763a53df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 02:06:13, skipping insertion in model container [2024-11-24 02:06:13,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 02:06:13" (3/3) ... [2024-11-24 02:06:13,752 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test1-1.i [2024-11-24 02:06:13,769 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 02:06:13,771 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_nondet_test1-1.i that has 3 procedures, 743 locations, 1 initial locations, 20 loop locations, and 320 error locations. [2024-11-24 02:06:13,831 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 02:06:13,845 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;@6ff1897f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 02:06:13,845 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-24 02:06:13,852 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-11-24 02:06:13,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-24 02:06:13,857 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:06:13,858 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-24 02:06:13,858 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-11-24 02:06:13,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:06:13,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103276, now seen corresponding path program 1 times [2024-11-24 02:06:13,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:06:13,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127994463] [2024-11-24 02:06:13,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:13,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:06:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:14,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:14,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:06:14,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127994463] [2024-11-24 02:06:14,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127994463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:06:14,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:06:14,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:06:14,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943013570] [2024-11-24 02:06:14,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:06:14,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 02:06:14,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:06:14,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 02:06:14,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 02:06:14,084 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-11-24 02:06:14,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:06:14,157 INFO L93 Difference]: Finished difference Result 728 states and 816 transitions. [2024-11-24 02:06:14,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 02:06:14,159 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-24 02:06:14,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:06:14,174 INFO L225 Difference]: With dead ends: 728 [2024-11-24 02:06:14,174 INFO L226 Difference]: Without dead ends: 726 [2024-11-24 02:06:14,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 02:06:14,180 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-11-24 02:06:14,181 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-11-24 02:06:14,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2024-11-24 02:06:14,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2024-11-24 02:06:14,264 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-11-24 02:06:14,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 814 transitions. [2024-11-24 02:06:14,279 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 814 transitions. Word has length 6 [2024-11-24 02:06:14,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:06:14,280 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 814 transitions. [2024-11-24 02:06:14,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 02:06:14,280 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 814 transitions. [2024-11-24 02:06:14,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-24 02:06:14,281 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:06:14,281 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-24 02:06:14,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-24 02:06:14,281 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-11-24 02:06:14,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:06:14,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103338, now seen corresponding path program 1 times [2024-11-24 02:06:14,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:06:14,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594026887] [2024-11-24 02:06:14,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:14,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:06:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:14,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:14,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:06:14,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594026887] [2024-11-24 02:06:14,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594026887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:06:14,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:06:14,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:06:14,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424456386] [2024-11-24 02:06:14,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:06:14,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:06:14,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:06:14,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:06:14,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:06:14,450 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-11-24 02:06:15,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:06:15,320 INFO L93 Difference]: Finished difference Result 680 states and 769 transitions. [2024-11-24 02:06:15,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:06:15,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-24 02:06:15,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:06:15,327 INFO L225 Difference]: With dead ends: 680 [2024-11-24 02:06:15,327 INFO L226 Difference]: Without dead ends: 680 [2024-11-24 02:06:15,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:06:15,328 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 679 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2024-11-24 02:06:15,328 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.8s Time] [2024-11-24 02:06:15,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-11-24 02:06:15,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 677. [2024-11-24 02:06:15,372 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-11-24 02:06:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 765 transitions. [2024-11-24 02:06:15,381 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 765 transitions. Word has length 6 [2024-11-24 02:06:15,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:06:15,381 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 765 transitions. [2024-11-24 02:06:15,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 02:06:15,381 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 765 transitions. [2024-11-24 02:06:15,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-24 02:06:15,382 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:06:15,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-24 02:06:15,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 02:06:15,382 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-11-24 02:06:15,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:06:15,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103339, now seen corresponding path program 1 times [2024-11-24 02:06:15,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:06:15,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590357422] [2024-11-24 02:06:15,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:15,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:06:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:15,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:15,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:06:15,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590357422] [2024-11-24 02:06:15,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590357422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:06:15,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:06:15,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:06:15,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202543649] [2024-11-24 02:06:15,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:06:15,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:06:15,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:06:15,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:06:15,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:06:15,609 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-11-24 02:06:16,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:06:16,354 INFO L93 Difference]: Finished difference Result 755 states and 849 transitions. [2024-11-24 02:06:16,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:06:16,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-24 02:06:16,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:06:16,358 INFO L225 Difference]: With dead ends: 755 [2024-11-24 02:06:16,359 INFO L226 Difference]: Without dead ends: 755 [2024-11-24 02:06:16,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:06:16,360 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 417 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-24 02:06:16,360 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.7s Time] [2024-11-24 02:06:16,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2024-11-24 02:06:16,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 706. [2024-11-24 02:06:16,380 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-11-24 02:06:16,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 833 transitions. [2024-11-24 02:06:16,385 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 833 transitions. Word has length 6 [2024-11-24 02:06:16,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:06:16,385 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 833 transitions. [2024-11-24 02:06:16,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-11-24 02:06:16,385 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 833 transitions. [2024-11-24 02:06:16,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-24 02:06:16,386 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:06:16,386 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-24 02:06:16,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 02:06:16,386 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-11-24 02:06:16,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:06:16,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1423421085, now seen corresponding path program 1 times [2024-11-24 02:06:16,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:06:16,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651491350] [2024-11-24 02:06:16,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:16,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:06:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:16,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:16,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:06:16,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651491350] [2024-11-24 02:06:16,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651491350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:06:16,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:06:16,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 02:06:16,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192282211] [2024-11-24 02:06:16,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:06:16,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:06:16,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:06:16,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:06:16,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:06:16,452 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-11-24 02:06:16,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:06:16,503 INFO L93 Difference]: Finished difference Result 1388 states and 1641 transitions. [2024-11-24 02:06:16,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:06:16,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-24 02:06:16,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:06:16,510 INFO L225 Difference]: With dead ends: 1388 [2024-11-24 02:06:16,510 INFO L226 Difference]: Without dead ends: 1388 [2024-11-24 02:06:16,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:06:16,511 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-11-24 02:06:16,511 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-11-24 02:06:16,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-11-24 02:06:16,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 707. [2024-11-24 02:06:16,540 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-11-24 02:06:16,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 834 transitions. [2024-11-24 02:06:16,545 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 834 transitions. Word has length 6 [2024-11-24 02:06:16,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:06:16,545 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 834 transitions. [2024-11-24 02:06:16,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 02:06:16,545 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 834 transitions. [2024-11-24 02:06:16,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-24 02:06:16,546 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:06:16,546 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:06:16,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-24 02:06:16,546 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-11-24 02:06:16,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:06:16,547 INFO L85 PathProgramCache]: Analyzing trace with hash 247711511, now seen corresponding path program 1 times [2024-11-24 02:06:16,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:06:16,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798438018] [2024-11-24 02:06:16,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:16,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:06:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:16,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:16,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:06:16,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798438018] [2024-11-24 02:06:16,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798438018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:06:16,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:06:16,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 02:06:16,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060173139] [2024-11-24 02:06:16,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:06:16,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 02:06:16,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:06:16,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 02:06:16,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 02:06:16,747 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-11-24 02:06:17,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:06:17,593 INFO L93 Difference]: Finished difference Result 734 states and 888 transitions. [2024-11-24 02:06:17,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 02:06:17,594 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-11-24 02:06:17,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:06:17,598 INFO L225 Difference]: With dead ends: 734 [2024-11-24 02:06:17,598 INFO L226 Difference]: Without dead ends: 734 [2024-11-24 02:06:17,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-24 02:06:17,599 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 943 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2024-11-24 02:06:17,599 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.8s Time] [2024-11-24 02:06:17,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2024-11-24 02:06:17,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 684. [2024-11-24 02:06:17,622 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-11-24 02:06:17,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 811 transitions. [2024-11-24 02:06:17,628 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 811 transitions. Word has length 16 [2024-11-24 02:06:17,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:06:17,629 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 811 transitions. [2024-11-24 02:06:17,629 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-11-24 02:06:17,629 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 811 transitions. [2024-11-24 02:06:17,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-24 02:06:17,630 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:06:17,631 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:06:17,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-24 02:06:17,635 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-11-24 02:06:17,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:06:17,635 INFO L85 PathProgramCache]: Analyzing trace with hash 247711512, now seen corresponding path program 1 times [2024-11-24 02:06:17,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:06:17,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922594794] [2024-11-24 02:06:17,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:17,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:06:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:17,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:17,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:06:17,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922594794] [2024-11-24 02:06:17,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922594794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:06:17,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:06:17,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 02:06:17,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478316791] [2024-11-24 02:06:17,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:06:17,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:06:17,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:06:17,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:06:17,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:06:17,770 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-11-24 02:06:17,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:06:17,818 INFO L93 Difference]: Finished difference Result 609 states and 708 transitions. [2024-11-24 02:06:17,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:06:17,818 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-11-24 02:06:17,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:06:17,822 INFO L225 Difference]: With dead ends: 609 [2024-11-24 02:06:17,822 INFO L226 Difference]: Without dead ends: 609 [2024-11-24 02:06:17,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:06:17,823 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-11-24 02:06:17,824 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-11-24 02:06:17,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-24 02:06:17,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-24 02:06:17,841 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-11-24 02:06:17,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 708 transitions. [2024-11-24 02:06:17,845 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 708 transitions. Word has length 16 [2024-11-24 02:06:17,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:06:17,846 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 708 transitions. [2024-11-24 02:06:17,846 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-11-24 02:06:17,846 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 708 transitions. [2024-11-24 02:06:17,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-24 02:06:17,847 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:06:17,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:06:17,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-24 02:06:17,847 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-11-24 02:06:17,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:06:17,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1827838193, now seen corresponding path program 1 times [2024-11-24 02:06:17,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:06:17,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712176825] [2024-11-24 02:06:17,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:17,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:06:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:17,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:06:17,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712176825] [2024-11-24 02:06:17,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712176825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:06:17,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:06:17,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 02:06:17,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053403153] [2024-11-24 02:06:17,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:06:17,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 02:06:17,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:06:17,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 02:06:17,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 02:06:17,948 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-11-24 02:06:18,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:06:18,034 INFO L93 Difference]: Finished difference Result 591 states and 683 transitions. [2024-11-24 02:06:18,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 02:06:18,035 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-11-24 02:06:18,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:06:18,038 INFO L225 Difference]: With dead ends: 591 [2024-11-24 02:06:18,038 INFO L226 Difference]: Without dead ends: 591 [2024-11-24 02:06:18,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-24 02:06:18,040 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.1s IncrementalHoareTripleChecker+Time [2024-11-24 02:06:18,040 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.1s Time] [2024-11-24 02:06:18,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-11-24 02:06:18,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 588. [2024-11-24 02:06:18,057 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-11-24 02:06:18,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 680 transitions. [2024-11-24 02:06:18,061 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 680 transitions. Word has length 18 [2024-11-24 02:06:18,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:06:18,062 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 680 transitions. [2024-11-24 02:06:18,062 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-11-24 02:06:18,062 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 680 transitions. [2024-11-24 02:06:18,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-24 02:06:18,063 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:06:18,063 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-11-24 02:06:18,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-24 02:06:18,064 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-11-24 02:06:18,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:06:18,064 INFO L85 PathProgramCache]: Analyzing trace with hash -385577985, now seen corresponding path program 1 times [2024-11-24 02:06:18,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:06:18,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157539338] [2024-11-24 02:06:18,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:18,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:06:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:18,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:18,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:06:18,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157539338] [2024-11-24 02:06:18,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157539338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:06:18,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:06:18,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 02:06:18,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549988137] [2024-11-24 02:06:18,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:06:18,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 02:06:18,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:06:18,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 02:06:18,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 02:06:18,381 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-11-24 02:06:19,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:06:19,178 INFO L93 Difference]: Finished difference Result 682 states and 768 transitions. [2024-11-24 02:06:19,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 02:06:19,179 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-11-24 02:06:19,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:06:19,182 INFO L225 Difference]: With dead ends: 682 [2024-11-24 02:06:19,182 INFO L226 Difference]: Without dead ends: 682 [2024-11-24 02:06:19,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-24 02:06:19,183 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 418 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-24 02:06:19,183 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.7s Time] [2024-11-24 02:06:19,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2024-11-24 02:06:19,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 584. [2024-11-24 02:06:19,199 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-11-24 02:06:19,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 676 transitions. [2024-11-24 02:06:19,202 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 676 transitions. Word has length 32 [2024-11-24 02:06:19,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:06:19,203 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 676 transitions. [2024-11-24 02:06:19,204 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-11-24 02:06:19,205 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 676 transitions. [2024-11-24 02:06:19,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-24 02:06:19,207 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:06:19,207 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-11-24 02:06:19,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-24 02:06:19,208 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-11-24 02:06:19,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:06:19,208 INFO L85 PathProgramCache]: Analyzing trace with hash 945049781, now seen corresponding path program 1 times [2024-11-24 02:06:19,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:06:19,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320416031] [2024-11-24 02:06:19,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:19,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:06:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:19,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:19,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:06:19,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320416031] [2024-11-24 02:06:19,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320416031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:06:19,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:06:19,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 02:06:19,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585234897] [2024-11-24 02:06:19,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:06:19,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 02:06:19,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:06:19,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 02:06:19,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 02:06:19,412 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-11-24 02:06:19,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:06:19,479 INFO L93 Difference]: Finished difference Result 584 states and 672 transitions. [2024-11-24 02:06:19,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 02:06:19,480 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-11-24 02:06:19,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:06:19,482 INFO L225 Difference]: With dead ends: 584 [2024-11-24 02:06:19,482 INFO L226 Difference]: Without dead ends: 584 [2024-11-24 02:06:19,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-24 02:06:19,483 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-11-24 02:06:19,484 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-11-24 02:06:19,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-11-24 02:06:19,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2024-11-24 02:06:19,497 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-11-24 02:06:19,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 672 transitions. [2024-11-24 02:06:19,500 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 672 transitions. Word has length 66 [2024-11-24 02:06:19,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:06:19,501 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 672 transitions. [2024-11-24 02:06:19,501 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-11-24 02:06:19,501 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 672 transitions. [2024-11-24 02:06:19,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-24 02:06:19,506 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:06:19,506 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-11-24 02:06:19,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-24 02:06:19,506 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-11-24 02:06:19,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:06:19,507 INFO L85 PathProgramCache]: Analyzing trace with hash -729166719, now seen corresponding path program 1 times [2024-11-24 02:06:19,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:06:19,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675031673] [2024-11-24 02:06:19,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:19,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:06:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:19,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:06:19,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675031673] [2024-11-24 02:06:19,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675031673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:06:19,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:06:19,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 02:06:19,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356337601] [2024-11-24 02:06:19,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:06:19,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:06:19,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:06:19,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:06:19,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:06:19,751 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-11-24 02:06:19,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:06:19,811 INFO L93 Difference]: Finished difference Result 681 states and 796 transitions. [2024-11-24 02:06:19,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:06:19,811 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-11-24 02:06:19,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:06:19,815 INFO L225 Difference]: With dead ends: 681 [2024-11-24 02:06:19,815 INFO L226 Difference]: Without dead ends: 681 [2024-11-24 02:06:19,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:06:19,816 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-11-24 02:06:19,816 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-11-24 02:06:19,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-11-24 02:06:19,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2024-11-24 02:06:19,831 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-11-24 02:06:19,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 796 transitions. [2024-11-24 02:06:19,835 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 796 transitions. Word has length 74 [2024-11-24 02:06:19,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:06:19,835 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 796 transitions. [2024-11-24 02:06:19,835 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-11-24 02:06:19,836 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 796 transitions. [2024-11-24 02:06:19,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-24 02:06:19,837 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:06:19,837 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-11-24 02:06:19,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-24 02:06:19,837 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-11-24 02:06:19,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:06:19,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1229812623, now seen corresponding path program 1 times [2024-11-24 02:06:19,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:06:19,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013995436] [2024-11-24 02:06:19,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:19,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:06:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:20,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:20,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:06:20,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013995436] [2024-11-24 02:06:20,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013995436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:06:20,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:06:20,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 02:06:20,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18473294] [2024-11-24 02:06:20,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:06:20,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 02:06:20,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:06:20,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 02:06:20,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-24 02:06:20,637 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-11-24 02:06:21,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:06:21,490 INFO L93 Difference]: Finished difference Result 643 states and 758 transitions. [2024-11-24 02:06:21,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 02:06:21,491 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-11-24 02:06:21,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:06:21,494 INFO L225 Difference]: With dead ends: 643 [2024-11-24 02:06:21,494 INFO L226 Difference]: Without dead ends: 643 [2024-11-24 02:06:21,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-24 02:06:21,496 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 938 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2024-11-24 02:06:21,496 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.8s Time] [2024-11-24 02:06:21,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2024-11-24 02:06:21,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 603. [2024-11-24 02:06:21,507 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-11-24 02:06:21,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 679 transitions. [2024-11-24 02:06:21,510 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 679 transitions. Word has length 77 [2024-11-24 02:06:21,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:06:21,511 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 679 transitions. [2024-11-24 02:06:21,511 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-11-24 02:06:21,511 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 679 transitions. [2024-11-24 02:06:21,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-24 02:06:21,515 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:06:21,515 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-11-24 02:06:21,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-24 02:06:21,516 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-11-24 02:06:21,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:06:21,516 INFO L85 PathProgramCache]: Analyzing trace with hash -795601644, now seen corresponding path program 1 times [2024-11-24 02:06:21,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:06:21,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505835757] [2024-11-24 02:06:21,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:21,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:06:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:21,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:21,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:06:21,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505835757] [2024-11-24 02:06:21,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505835757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:06:21,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:06:21,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 02:06:21,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983905065] [2024-11-24 02:06:21,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:06:21,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 02:06:21,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:06:21,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 02:06:21,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 02:06:21,876 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-11-24 02:06:22,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:06:22,500 INFO L93 Difference]: Finished difference Result 602 states and 678 transitions. [2024-11-24 02:06:22,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 02:06:22,501 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-11-24 02:06:22,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:06:22,504 INFO L225 Difference]: With dead ends: 602 [2024-11-24 02:06:22,504 INFO L226 Difference]: Without dead ends: 602 [2024-11-24 02:06:22,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-24 02:06:22,505 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 2 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-24 02:06:22,505 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.6s Time] [2024-11-24 02:06:22,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-24 02:06:22,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2024-11-24 02:06:22,518 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-11-24 02:06:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 678 transitions. [2024-11-24 02:06:22,521 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 678 transitions. Word has length 82 [2024-11-24 02:06:22,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:06:22,522 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 678 transitions. [2024-11-24 02:06:22,522 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-11-24 02:06:22,522 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 678 transitions. [2024-11-24 02:06:22,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-24 02:06:22,523 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:06:22,523 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-11-24 02:06:22,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-24 02:06:22,524 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-11-24 02:06:22,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:06:22,524 INFO L85 PathProgramCache]: Analyzing trace with hash -795601643, now seen corresponding path program 1 times [2024-11-24 02:06:22,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:06:22,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200835157] [2024-11-24 02:06:22,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:22,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:06:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:23,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-11-24 02:06:23,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:06:23,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200835157] [2024-11-24 02:06:23,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200835157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:06:23,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:06:23,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 02:06:23,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233950376] [2024-11-24 02:06:23,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:06:23,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 02:06:23,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:06:23,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 02:06:23,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 02:06:23,112 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-11-24 02:06:23,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:06:23,801 INFO L93 Difference]: Finished difference Result 601 states and 677 transitions. [2024-11-24 02:06:23,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 02:06:23,802 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-11-24 02:06:23,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:06:23,804 INFO L225 Difference]: With dead ends: 601 [2024-11-24 02:06:23,804 INFO L226 Difference]: Without dead ends: 601 [2024-11-24 02:06:23,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-24 02:06:23,805 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 1 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.7s IncrementalHoareTripleChecker+Time [2024-11-24 02:06:23,805 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.7s Time] [2024-11-24 02:06:23,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-24 02:06:23,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2024-11-24 02:06:23,815 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-11-24 02:06:23,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 677 transitions. [2024-11-24 02:06:23,818 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 677 transitions. Word has length 82 [2024-11-24 02:06:23,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:06:23,819 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 677 transitions. [2024-11-24 02:06:23,819 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-11-24 02:06:23,819 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 677 transitions. [2024-11-24 02:06:23,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-24 02:06:23,820 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:06:23,820 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:06:23,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-24 02:06:23,820 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-11-24 02:06:23,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:06:23,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1932962117, now seen corresponding path program 1 times [2024-11-24 02:06:23,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:06:23,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834937151] [2024-11-24 02:06:23,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:23,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:06:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:24,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:24,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:06:24,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834937151] [2024-11-24 02:06:24,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834937151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:06:24,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:06:24,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 02:06:24,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771985994] [2024-11-24 02:06:24,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:06:24,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 02:06:24,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:06:24,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 02:06:24,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-24 02:06:24,138 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-11-24 02:06:25,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:06:25,102 INFO L93 Difference]: Finished difference Result 613 states and 692 transitions. [2024-11-24 02:06:25,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 02:06:25,103 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-11-24 02:06:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:06:25,108 INFO L225 Difference]: With dead ends: 613 [2024-11-24 02:06:25,108 INFO L226 Difference]: Without dead ends: 613 [2024-11-24 02:06:25,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-24 02:06:25,110 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 6 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2024-11-24 02:06:25,110 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.9s Time] [2024-11-24 02:06:25,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-24 02:06:25,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 607. [2024-11-24 02:06:25,123 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-11-24 02:06:25,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 687 transitions. [2024-11-24 02:06:25,126 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 687 transitions. Word has length 90 [2024-11-24 02:06:25,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:06:25,126 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 687 transitions. [2024-11-24 02:06:25,126 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-11-24 02:06:25,127 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 687 transitions. [2024-11-24 02:06:25,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-24 02:06:25,128 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:06:25,128 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:06:25,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-24 02:06:25,128 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-11-24 02:06:25,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:06:25,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1932962116, now seen corresponding path program 1 times [2024-11-24 02:06:25,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:06:25,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523267432] [2024-11-24 02:06:25,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:25,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:06:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:25,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:25,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:06:25,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523267432] [2024-11-24 02:06:25,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523267432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:06:25,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:06:25,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 02:06:25,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390783260] [2024-11-24 02:06:25,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:06:25,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 02:06:25,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:06:25,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 02:06:25,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 02:06:25,859 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-11-24 02:06:26,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:06:26,850 INFO L93 Difference]: Finished difference Result 607 states and 686 transitions. [2024-11-24 02:06:26,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 02:06:26,851 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-11-24 02:06:26,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:06:26,854 INFO L225 Difference]: With dead ends: 607 [2024-11-24 02:06:26,855 INFO L226 Difference]: Without dead ends: 607 [2024-11-24 02:06:26,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-24 02:06:26,856 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 1 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2024-11-24 02:06:26,856 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.9s Time] [2024-11-24 02:06:26,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-11-24 02:06:26,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2024-11-24 02:06:26,870 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-11-24 02:06:26,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 686 transitions. [2024-11-24 02:06:26,874 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 686 transitions. Word has length 90 [2024-11-24 02:06:26,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:06:26,874 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 686 transitions. [2024-11-24 02:06:26,875 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-11-24 02:06:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 686 transitions. [2024-11-24 02:06:26,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-24 02:06:26,876 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:06:26,876 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-11-24 02:06:26,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-24 02:06:26,876 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-11-24 02:06:26,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:06:26,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1489621638, now seen corresponding path program 1 times [2024-11-24 02:06:26,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:06:26,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556270313] [2024-11-24 02:06:26,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:26,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:06:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:27,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:27,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:06:27,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556270313] [2024-11-24 02:06:27,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556270313] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:06:27,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431480675] [2024-11-24 02:06:27,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:27,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:06:27,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:06:27,691 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:06:27,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-24 02:06:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:27,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-24 02:06:27,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:06:28,193 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:06:28,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 02:06:28,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 02:06:28,340 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:06:28,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 02:06:28,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-24 02:06:28,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:28,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:06:28,491 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-24 02:06:28,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-24 02:06:28,504 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-11-24 02:06:28,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431480675] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:06:28,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 02:06:28,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2024-11-24 02:06:28,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078936017] [2024-11-24 02:06:28,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 02:06:28,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-24 02:06:28,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:06:28,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-24 02:06:28,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2024-11-24 02:06:28,517 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-11-24 02:06:30,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:06:30,527 INFO L93 Difference]: Finished difference Result 606 states and 685 transitions. [2024-11-24 02:06:30,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-24 02:06:30,528 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-11-24 02:06:30,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:06:30,531 INFO L225 Difference]: With dead ends: 606 [2024-11-24 02:06:30,531 INFO L226 Difference]: Without dead ends: 606 [2024-11-24 02:06:30,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=342, Unknown=1, NotChecked=38, Total=462 [2024-11-24 02:06:30,533 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 502 mSDsluCounter, 2494 mSDsCounter, 0 mSdLazyCounter, 2122 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.8s IncrementalHoareTripleChecker+Time [2024-11-24 02:06:30,534 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.8s Time] [2024-11-24 02:06:30,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-24 02:06:30,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2024-11-24 02:06:30,547 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-11-24 02:06:30,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 685 transitions. [2024-11-24 02:06:30,550 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 685 transitions. Word has length 91 [2024-11-24 02:06:30,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:06:30,550 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 685 transitions. [2024-11-24 02:06:30,550 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-11-24 02:06:30,550 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 685 transitions. [2024-11-24 02:06:30,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-24 02:06:30,551 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:06:30,552 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-11-24 02:06:30,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-24 02:06:30,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:06:30,753 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-11-24 02:06:30,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:06:30,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1489621639, now seen corresponding path program 1 times [2024-11-24 02:06:30,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:06:30,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119513224] [2024-11-24 02:06:30,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:30,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:06:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:31,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:31,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:06:31,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119513224] [2024-11-24 02:06:31,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119513224] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:06:31,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965085405] [2024-11-24 02:06:31,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:31,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:06:31,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:06:31,750 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:06:31,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-24 02:06:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:31,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-24 02:06:31,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:06:32,170 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:06:32,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 02:06:32,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-24 02:06:32,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-24 02:06:32,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 02:06:32,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-24 02:06:32,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-24 02:06:32,509 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:06:32,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 62 treesize of output 57 [2024-11-24 02:06:32,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:06:32,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-11-24 02:06:32,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-24 02:06:32,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:32,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:06:32,692 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-11-24 02:06:32,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965085405] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:06:32,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 02:06:32,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2024-11-24 02:06:32,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582820079] [2024-11-24 02:06:32,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 02:06:32,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-24 02:06:32,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:06:32,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-24 02:06:32,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2024-11-24 02:06:32,697 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-11-24 02:06:35,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:06:35,002 INFO L93 Difference]: Finished difference Result 613 states and 692 transitions. [2024-11-24 02:06:35,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-24 02:06:35,002 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-11-24 02:06:35,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:06:35,005 INFO L225 Difference]: With dead ends: 613 [2024-11-24 02:06:35,005 INFO L226 Difference]: Without dead ends: 613 [2024-11-24 02:06:35,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2024-11-24 02:06:35,006 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 495 mSDsluCounter, 1889 mSDsCounter, 0 mSdLazyCounter, 2178 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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, 2.1s IncrementalHoareTripleChecker+Time [2024-11-24 02:06:35,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 2218 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2178 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-24 02:06:35,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-24 02:06:35,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 604. [2024-11-24 02:06:35,017 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-11-24 02:06:35,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 680 transitions. [2024-11-24 02:06:35,020 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 680 transitions. Word has length 91 [2024-11-24 02:06:35,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:06:35,020 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 680 transitions. [2024-11-24 02:06:35,021 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-11-24 02:06:35,021 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 680 transitions. [2024-11-24 02:06:35,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-24 02:06:35,022 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:06:35,022 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:06:35,032 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-24 02:06:35,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:06:35,226 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-11-24 02:06:35,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:06:35,227 INFO L85 PathProgramCache]: Analyzing trace with hash 2047694902, now seen corresponding path program 1 times [2024-11-24 02:06:35,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:06:35,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677061939] [2024-11-24 02:06:35,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:35,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:06:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:35,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:35,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:06:35,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677061939] [2024-11-24 02:06:35,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677061939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:06:35,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:06:35,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-24 02:06:35,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611130873] [2024-11-24 02:06:35,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:06:35,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-24 02:06:35,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:06:35,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-24 02:06:35,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-24 02:06:35,884 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-11-24 02:06:37,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:06:37,400 INFO L93 Difference]: Finished difference Result 617 states and 696 transitions. [2024-11-24 02:06:37,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-24 02:06:37,400 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-11-24 02:06:37,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:06:37,403 INFO L225 Difference]: With dead ends: 617 [2024-11-24 02:06:37,403 INFO L226 Difference]: Without dead ends: 617 [2024-11-24 02:06:37,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-24 02:06:37,404 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 502 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 1914 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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, 1.3s IncrementalHoareTripleChecker+Time [2024-11-24 02:06:37,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 2507 Invalid, 1928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1914 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-24 02:06:37,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-24 02:06:37,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2024-11-24 02:06:37,418 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-11-24 02:06:37,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 691 transitions. [2024-11-24 02:06:37,420 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 691 transitions. Word has length 93 [2024-11-24 02:06:37,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:06:37,421 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 691 transitions. [2024-11-24 02:06:37,421 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-11-24 02:06:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 691 transitions. [2024-11-24 02:06:37,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-24 02:06:37,422 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:06:37,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:06:37,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-24 02:06:37,423 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-11-24 02:06:37,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:06:37,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2047694903, now seen corresponding path program 1 times [2024-11-24 02:06:37,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:06:37,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293837271] [2024-11-24 02:06:37,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:37,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:06:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:38,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:38,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:06:38,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293837271] [2024-11-24 02:06:38,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293837271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:06:38,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:06:38,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 02:06:38,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238844753] [2024-11-24 02:06:38,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:06:38,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-24 02:06:38,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:06:38,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-24 02:06:38,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-24 02:06:38,356 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-11-24 02:06:39,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:06:39,903 INFO L93 Difference]: Finished difference Result 616 states and 695 transitions. [2024-11-24 02:06:39,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-24 02:06:39,904 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-11-24 02:06:39,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:06:39,906 INFO L225 Difference]: With dead ends: 616 [2024-11-24 02:06:39,906 INFO L226 Difference]: Without dead ends: 616 [2024-11-24 02:06:39,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-24 02:06:39,907 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 479 mSDsluCounter, 1565 mSDsCounter, 0 mSdLazyCounter, 1956 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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, 1.4s IncrementalHoareTripleChecker+Time [2024-11-24 02:06:39,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 1895 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1956 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-24 02:06:39,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-24 02:06:39,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 613. [2024-11-24 02:06:39,918 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-11-24 02:06:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 690 transitions. [2024-11-24 02:06:39,920 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 690 transitions. Word has length 93 [2024-11-24 02:06:39,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:06:39,920 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 690 transitions. [2024-11-24 02:06:39,921 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-11-24 02:06:39,922 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 690 transitions. [2024-11-24 02:06:39,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-24 02:06:39,923 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:06:39,923 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-11-24 02:06:39,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-24 02:06:39,923 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-11-24 02:06:39,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:06:39,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1716733067, now seen corresponding path program 1 times [2024-11-24 02:06:39,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:06:39,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505049139] [2024-11-24 02:06:39,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:39,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:06:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:40,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:40,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:06:40,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505049139] [2024-11-24 02:06:40,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505049139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:06:40,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915748131] [2024-11-24 02:06:40,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:40,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:06:40,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:06:40,587 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:06:40,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-24 02:06:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:40,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-24 02:06:40,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:06:41,029 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:06:41,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 02:06:41,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 02:06:41,132 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:06:41,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 42 treesize of output 41 [2024-11-24 02:06:41,200 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:06:41,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 02:06:41,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-24 02:06:41,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:41,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:06:41,240 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-11-24 02:06:41,369 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-24 02:06:41,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-24 02:06:41,376 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-11-24 02:06:41,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915748131] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:06:41,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 02:06:41,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2024-11-24 02:06:41,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325197083] [2024-11-24 02:06:41,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 02:06:41,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-24 02:06:41,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:06:41,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-24 02:06:41,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=225, Unknown=6, NotChecked=62, Total=342 [2024-11-24 02:06:41,379 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-11-24 02:06:42,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:06:42,967 INFO L93 Difference]: Finished difference Result 615 states and 694 transitions. [2024-11-24 02:06:42,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-24 02:06:42,968 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-11-24 02:06:42,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:06:42,970 INFO L225 Difference]: With dead ends: 615 [2024-11-24 02:06:42,970 INFO L226 Difference]: Without dead ends: 615 [2024-11-24 02:06:42,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=451, Unknown=6, NotChecked=90, Total=650 [2024-11-24 02:06:42,971 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 496 mSDsluCounter, 3065 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2024-11-24 02:06:42,971 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.4s Time] [2024-11-24 02:06:42,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-24 02:06:42,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 612. [2024-11-24 02:06:42,986 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-11-24 02:06:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 689 transitions. [2024-11-24 02:06:42,988 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 689 transitions. Word has length 94 [2024-11-24 02:06:42,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:06:42,988 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 689 transitions. [2024-11-24 02:06:42,989 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-11-24 02:06:42,989 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 689 transitions. [2024-11-24 02:06:42,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-24 02:06:42,990 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:06:42,990 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-11-24 02:06:43,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-24 02:06:43,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:06:43,191 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-11-24 02:06:43,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:06:43,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1716733068, now seen corresponding path program 1 times [2024-11-24 02:06:43,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:06:43,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885713909] [2024-11-24 02:06:43,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:43,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:06:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:44,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:06:44,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885713909] [2024-11-24 02:06:44,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885713909] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:06:44,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007060449] [2024-11-24 02:06:44,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:44,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:06:44,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:06:44,276 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:06:44,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-24 02:06:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:44,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-24 02:06:44,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:06:44,689 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:06:44,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 02:06:44,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 02:06:44,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-24 02:06:45,019 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:06:45,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-24 02:06:45,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:06:45,162 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:06:45,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-24 02:06:45,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-11-24 02:06:45,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-24 02:06:45,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-24 02:06:45,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:45,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:06:45,349 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-11-24 02:06:45,366 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-11-24 02:06:45,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 02:06:45,517 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-11-24 02:06:45,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007060449] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:06:45,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 02:06:45,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2024-11-24 02:06:45,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153517799] [2024-11-24 02:06:45,687 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 02:06:45,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-24 02:06:45,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:06:45,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-24 02:06:45,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=478, Unknown=2, NotChecked=90, Total=650 [2024-11-24 02:06:45,690 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-11-24 02:06:48,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:06:48,529 INFO L93 Difference]: Finished difference Result 614 states and 693 transitions. [2024-11-24 02:06:48,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-24 02:06:48,529 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-11-24 02:06:48,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:06:48,531 INFO L225 Difference]: With dead ends: 614 [2024-11-24 02:06:48,532 INFO L226 Difference]: Without dead ends: 614 [2024-11-24 02:06:48,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=690, Unknown=2, NotChecked=110, Total=930 [2024-11-24 02:06:48,532 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 474 mSDsluCounter, 3248 mSDsCounter, 0 mSdLazyCounter, 3528 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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, 2.6s IncrementalHoareTripleChecker+Time [2024-11-24 02:06:48,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 3572 Invalid, 3547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3528 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-24 02:06:48,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-24 02:06:48,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 602. [2024-11-24 02:06:48,541 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-11-24 02:06:48,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 678 transitions. [2024-11-24 02:06:48,542 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 678 transitions. Word has length 94 [2024-11-24 02:06:48,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:06:48,543 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 678 transitions. [2024-11-24 02:06:48,543 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-11-24 02:06:48,543 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 678 transitions. [2024-11-24 02:06:48,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-24 02:06:48,544 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:06:48,544 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:06:48,555 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-24 02:06:48,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:06:48,745 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-11-24 02:06:48,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:06:48,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1458945026, now seen corresponding path program 1 times [2024-11-24 02:06:48,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:06:48,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133346448] [2024-11-24 02:06:48,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:48,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:06:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:49,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:49,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:06:49,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133346448] [2024-11-24 02:06:49,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133346448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:06:49,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:06:49,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-24 02:06:49,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692025071] [2024-11-24 02:06:49,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:06:49,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-24 02:06:49,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:06:49,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-24 02:06:49,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-24 02:06:49,384 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-11-24 02:06:50,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:06:50,588 INFO L93 Difference]: Finished difference Result 618 states and 697 transitions. [2024-11-24 02:06:50,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-24 02:06:50,591 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-11-24 02:06:50,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:06:50,593 INFO L225 Difference]: With dead ends: 618 [2024-11-24 02:06:50,593 INFO L226 Difference]: Without dead ends: 618 [2024-11-24 02:06:50,594 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-11-24 02:06:50,595 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 503 mSDsluCounter, 2177 mSDsCounter, 0 mSdLazyCounter, 1915 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.1s IncrementalHoareTripleChecker+Time [2024-11-24 02:06:50,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 2502 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1915 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-24 02:06:50,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-24 02:06:50,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 614. [2024-11-24 02:06:50,605 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-11-24 02:06:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 692 transitions. [2024-11-24 02:06:50,608 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 692 transitions. Word has length 96 [2024-11-24 02:06:50,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:06:50,609 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 692 transitions. [2024-11-24 02:06:50,609 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-11-24 02:06:50,609 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 692 transitions. [2024-11-24 02:06:50,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-24 02:06:50,610 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:06:50,610 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:06:50,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-24 02:06:50,610 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-11-24 02:06:50,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:06:50,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1458945027, now seen corresponding path program 1 times [2024-11-24 02:06:50,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:06:50,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638075647] [2024-11-24 02:06:50,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:50,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:06:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:51,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:51,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:06:51,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638075647] [2024-11-24 02:06:51,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638075647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:06:51,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:06:51,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-24 02:06:51,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993247946] [2024-11-24 02:06:51,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:06:51,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-24 02:06:51,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:06:51,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-24 02:06:51,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-24 02:06:51,508 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-11-24 02:06:53,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:06:53,232 INFO L93 Difference]: Finished difference Result 617 states and 696 transitions. [2024-11-24 02:06:53,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 02:06:53,233 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-11-24 02:06:53,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:06:53,234 INFO L225 Difference]: With dead ends: 617 [2024-11-24 02:06:53,234 INFO L226 Difference]: Without dead ends: 617 [2024-11-24 02:06:53,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-24 02:06:53,235 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 497 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.6s IncrementalHoareTripleChecker+Time [2024-11-24 02:06:53,235 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.6s Time] [2024-11-24 02:06:53,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-24 02:06:53,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 614. [2024-11-24 02:06:53,244 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-11-24 02:06:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 691 transitions. [2024-11-24 02:06:53,246 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 691 transitions. Word has length 96 [2024-11-24 02:06:53,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:06:53,246 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 691 transitions. [2024-11-24 02:06:53,246 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-11-24 02:06:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 691 transitions. [2024-11-24 02:06:53,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-24 02:06:53,248 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:06:53,248 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-11-24 02:06:53,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-24 02:06:53,248 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-11-24 02:06:53,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:06:53,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1275137139, now seen corresponding path program 1 times [2024-11-24 02:06:53,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:06:53,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737718961] [2024-11-24 02:06:53,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:53,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:06:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:54,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:54,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:06:54,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737718961] [2024-11-24 02:06:54,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737718961] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:06:54,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415151279] [2024-11-24 02:06:54,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:54,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:06:54,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:06:54,026 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:06:54,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-24 02:06:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:54,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-24 02:06:54,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:06:54,414 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:06:54,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 02:06:54,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 02:06:54,492 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:06:54,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 02:06:54,553 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:06:54,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 02:06:54,618 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:06:54,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 02:06:54,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-24 02:06:54,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:54,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:06:54,746 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-11-24 02:06:54,756 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-11-24 02:06:54,812 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-24 02:06:54,812 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-11-24 02:06:54,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415151279] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:06:54,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 02:06:54,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 17 [2024-11-24 02:06:54,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353550188] [2024-11-24 02:06:54,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 02:06:54,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-24 02:06:54,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:06:54,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-24 02:06:54,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=337, Unknown=22, NotChecked=78, Total=506 [2024-11-24 02:06:54,880 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-11-24 02:06:56,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:06:56,747 INFO L93 Difference]: Finished difference Result 616 states and 695 transitions. [2024-11-24 02:06:56,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-24 02:06:56,747 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-11-24 02:06:56,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:06:56,749 INFO L225 Difference]: With dead ends: 616 [2024-11-24 02:06:56,749 INFO L226 Difference]: Without dead ends: 616 [2024-11-24 02:06:56,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=661, Unknown=22, NotChecked=110, Total=930 [2024-11-24 02:06:56,750 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 474 mSDsluCounter, 3069 mSDsCounter, 0 mSdLazyCounter, 2594 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.7s IncrementalHoareTripleChecker+Time [2024-11-24 02:06:56,750 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.7s Time] [2024-11-24 02:06:56,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-24 02:06:56,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 613. [2024-11-24 02:06:56,759 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-11-24 02:06:56,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 690 transitions. [2024-11-24 02:06:56,761 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 690 transitions. Word has length 97 [2024-11-24 02:06:56,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:06:56,762 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 690 transitions. [2024-11-24 02:06:56,762 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-11-24 02:06:56,762 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 690 transitions. [2024-11-24 02:06:56,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-24 02:06:56,763 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:06:56,764 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-11-24 02:06:56,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-24 02:06:56,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-24 02:06:56,964 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-11-24 02:06:56,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:06:56,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1275137138, now seen corresponding path program 1 times [2024-11-24 02:06:56,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:06:56,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626813474] [2024-11-24 02:06:56,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:56,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:06:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:58,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:58,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:06:58,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626813474] [2024-11-24 02:06:58,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626813474] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:06:58,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940879389] [2024-11-24 02:06:58,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:06:58,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:06:58,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:06:58,054 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:06:58,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-24 02:06:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:58,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-24 02:06:58,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:06:58,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-24 02:06:58,452 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:06:58,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 02:06:58,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-24 02:06:58,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 02:06:58,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-24 02:06:58,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-24 02:06:58,747 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:06:58,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-24 02:06:58,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:06:58,859 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:06:58,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-24 02:06:58,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:06:58,956 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:06:58,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-24 02:06:58,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:06:58,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-24 02:06:58,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-24 02:06:59,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:06:59,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:06:59,086 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-11-24 02:06:59,102 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-11-24 02:06:59,125 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-11-24 02:06:59,141 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-11-24 02:06:59,206 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-11-24 02:06:59,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940879389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:06:59,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 02:06:59,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2024-11-24 02:06:59,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371473168] [2024-11-24 02:06:59,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 02:06:59,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-24 02:06:59,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:06:59,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-24 02:06:59,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=479, Unknown=5, NotChecked=240, Total=812 [2024-11-24 02:06:59,210 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-11-24 02:07:01,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:07:01,475 INFO L93 Difference]: Finished difference Result 615 states and 694 transitions. [2024-11-24 02:07:01,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-24 02:07:01,476 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-11-24 02:07:01,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:07:01,478 INFO L225 Difference]: With dead ends: 615 [2024-11-24 02:07:01,478 INFO L226 Difference]: Without dead ends: 615 [2024-11-24 02:07:01,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=744, Unknown=5, NotChecked=300, Total=1190 [2024-11-24 02:07:01,479 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 493 mSDsluCounter, 2601 mSDsCounter, 0 mSdLazyCounter, 3116 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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, 2.0s IncrementalHoareTripleChecker+Time [2024-11-24 02:07:01,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 2928 Invalid, 3135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3116 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-24 02:07:01,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-24 02:07:01,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 600. [2024-11-24 02:07:01,488 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-11-24 02:07:01,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 676 transitions. [2024-11-24 02:07:01,489 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 676 transitions. Word has length 97 [2024-11-24 02:07:01,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:07:01,490 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 676 transitions. [2024-11-24 02:07:01,490 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-11-24 02:07:01,490 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 676 transitions. [2024-11-24 02:07:01,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-24 02:07:01,491 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:07:01,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:07:01,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-24 02:07:01,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:07:01,695 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-11-24 02:07:01,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:07:01,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1637134370, now seen corresponding path program 1 times [2024-11-24 02:07:01,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:07:01,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47239059] [2024-11-24 02:07:01,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:01,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:07:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:07:02,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:07:02,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:07:02,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47239059] [2024-11-24 02:07:02,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47239059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:07:02,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:07:02,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-24 02:07:02,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139195620] [2024-11-24 02:07:02,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:07:02,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-24 02:07:02,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:07:02,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-24 02:07:02,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-24 02:07:02,568 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-11-24 02:07:04,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:07:04,650 INFO L93 Difference]: Finished difference Result 619 states and 698 transitions. [2024-11-24 02:07:04,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-24 02:07:04,651 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-11-24 02:07:04,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:07:04,653 INFO L225 Difference]: With dead ends: 619 [2024-11-24 02:07:04,653 INFO L226 Difference]: Without dead ends: 619 [2024-11-24 02:07:04,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-24 02:07:04,654 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 482 mSDsluCounter, 2315 mSDsCounter, 0 mSdLazyCounter, 2806 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.9s IncrementalHoareTripleChecker+Time [2024-11-24 02:07:04,654 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.9s Time] [2024-11-24 02:07:04,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-24 02:07:04,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 615. [2024-11-24 02:07:04,663 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-11-24 02:07:04,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 693 transitions. [2024-11-24 02:07:04,665 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 693 transitions. Word has length 99 [2024-11-24 02:07:04,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:07:04,665 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 693 transitions. [2024-11-24 02:07:04,666 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-11-24 02:07:04,666 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 693 transitions. [2024-11-24 02:07:04,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-24 02:07:04,667 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:07:04,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:07:04,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-24 02:07:04,667 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-11-24 02:07:04,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:07:04,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1637134371, now seen corresponding path program 1 times [2024-11-24 02:07:04,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:07:04,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090149386] [2024-11-24 02:07:04,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:04,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:07:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:07:05,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:07:05,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:07:05,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090149386] [2024-11-24 02:07:05,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090149386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:07:05,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:07:05,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-24 02:07:05,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512253933] [2024-11-24 02:07:05,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:07:05,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-24 02:07:05,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:07:05,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-24 02:07:05,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-24 02:07:05,398 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-11-24 02:07:07,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:07:07,105 INFO L93 Difference]: Finished difference Result 618 states and 697 transitions. [2024-11-24 02:07:07,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-24 02:07:07,106 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-11-24 02:07:07,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:07:07,108 INFO L225 Difference]: With dead ends: 618 [2024-11-24 02:07:07,108 INFO L226 Difference]: Without dead ends: 618 [2024-11-24 02:07:07,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2024-11-24 02:07:07,109 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 484 mSDsluCounter, 2790 mSDsCounter, 0 mSdLazyCounter, 2370 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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, 1.5s IncrementalHoareTripleChecker+Time [2024-11-24 02:07:07,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 3115 Invalid, 2384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2370 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-24 02:07:07,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-24 02:07:07,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 615. [2024-11-24 02:07:07,117 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-11-24 02:07:07,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 692 transitions. [2024-11-24 02:07:07,118 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 692 transitions. Word has length 99 [2024-11-24 02:07:07,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:07:07,118 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 692 transitions. [2024-11-24 02:07:07,118 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-11-24 02:07:07,118 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 692 transitions. [2024-11-24 02:07:07,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-24 02:07:07,119 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:07:07,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:07:07,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-24 02:07:07,119 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-11-24 02:07:07,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:07:07,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1375856755, now seen corresponding path program 1 times [2024-11-24 02:07:07,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:07:07,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072102853] [2024-11-24 02:07:07,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:07,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:07:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:07:08,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:07:08,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:07:08,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072102853] [2024-11-24 02:07:08,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072102853] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:07:08,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029473620] [2024-11-24 02:07:08,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:08,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:07:08,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:07:08,226 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:07:08,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-24 02:07:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:07:08,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-24 02:07:08,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:07:08,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-24 02:07:08,616 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:07:08,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 02:07:08,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-24 02:07:08,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 02:07:08,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-24 02:07:08,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-24 02:07:08,821 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:07:08,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-24 02:07:08,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:07:08,908 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:07:08,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-24 02:07:08,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:07:09,003 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:07:09,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-24 02:07:09,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:07:09,096 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:07:09,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-24 02:07:09,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:07:09,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-24 02:07:09,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-24 02:07:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:07:09,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:07:09,202 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-11-24 02:07:09,214 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-11-24 02:07:09,239 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-11-24 02:07:09,362 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-11-24 02:07:09,396 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-11-24 02:07:09,573 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-11-24 02:07:09,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029473620] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:07:09,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 02:07:09,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 19 [2024-11-24 02:07:09,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740503421] [2024-11-24 02:07:09,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 02:07:09,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-24 02:07:09,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:07:09,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-24 02:07:09,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=421, Unknown=13, NotChecked=282, Total=812 [2024-11-24 02:07:09,578 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-11-24 02:07:12,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:07:12,221 INFO L93 Difference]: Finished difference Result 617 states and 696 transitions. [2024-11-24 02:07:12,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-24 02:07:12,221 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-11-24 02:07:12,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:07:12,224 INFO L225 Difference]: With dead ends: 617 [2024-11-24 02:07:12,224 INFO L226 Difference]: Without dead ends: 617 [2024-11-24 02:07:12,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=725, Unknown=13, NotChecked=366, Total=1260 [2024-11-24 02:07:12,226 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 472 mSDsluCounter, 2124 mSDsCounter, 0 mSdLazyCounter, 2486 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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, 2.4s IncrementalHoareTripleChecker+Time [2024-11-24 02:07:12,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 2450 Invalid, 2501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2486 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-24 02:07:12,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-24 02:07:12,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 614. [2024-11-24 02:07:12,243 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-11-24 02:07:12,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 691 transitions. [2024-11-24 02:07:12,245 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 691 transitions. Word has length 100 [2024-11-24 02:07:12,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:07:12,245 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 691 transitions. [2024-11-24 02:07:12,245 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-11-24 02:07:12,246 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 691 transitions. [2024-11-24 02:07:12,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-24 02:07:12,247 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:07:12,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:07:12,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-24 02:07:12,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-24 02:07:12,448 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-11-24 02:07:12,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:07:12,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1375856754, now seen corresponding path program 1 times [2024-11-24 02:07:12,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:07:12,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010438548] [2024-11-24 02:07:12,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:12,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:07:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:07:13,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:07:13,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:07:13,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010438548] [2024-11-24 02:07:13,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010438548] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:07:13,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936834185] [2024-11-24 02:07:13,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:13,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:07:13,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:07:13,221 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:07:13,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-24 02:07:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:07:13,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-24 02:07:13,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:07:13,647 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:07:13,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 02:07:13,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 02:07:13,727 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:07:13,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 02:07:13,786 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:07:13,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 02:07:13,851 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:07:13,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 02:07:13,911 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:07:13,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 02:07:13,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-24 02:07:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:07:13,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:07:13,952 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-11-24 02:07:14,010 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-11-24 02:07:14,018 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-11-24 02:07:14,029 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-11-24 02:07:14,134 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-24 02:07:14,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 104 [2024-11-24 02:07:14,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936834185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:07:14,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 02:07:14,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 19 [2024-11-24 02:07:14,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123787701] [2024-11-24 02:07:14,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 02:07:14,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-24 02:07:14,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:07:14,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-24 02:07:14,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=407, Unknown=25, NotChecked=180, Total=702 [2024-11-24 02:07:14,233 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-11-24 02:07:16,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:07:16,019 INFO L93 Difference]: Finished difference Result 616 states and 695 transitions. [2024-11-24 02:07:16,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-24 02:07:16,019 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-11-24 02:07:16,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:07:16,021 INFO L225 Difference]: With dead ends: 616 [2024-11-24 02:07:16,021 INFO L226 Difference]: Without dead ends: 616 [2024-11-24 02:07:16,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=174, Invalid=809, Unknown=25, NotChecked=252, Total=1260 [2024-11-24 02:07:16,022 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 485 mSDsluCounter, 2789 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2024-11-24 02:07:16,022 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.5s Time] [2024-11-24 02:07:16,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-24 02:07:16,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 598. [2024-11-24 02:07:16,029 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-11-24 02:07:16,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 674 transitions. [2024-11-24 02:07:16,030 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 674 transitions. Word has length 100 [2024-11-24 02:07:16,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:07:16,030 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 674 transitions. [2024-11-24 02:07:16,030 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-11-24 02:07:16,031 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 674 transitions. [2024-11-24 02:07:16,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-24 02:07:16,031 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:07:16,031 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:07:16,042 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-24 02:07:16,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-24 02:07:16,232 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-11-24 02:07:16,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:07:16,232 INFO L85 PathProgramCache]: Analyzing trace with hash -679205281, now seen corresponding path program 1 times [2024-11-24 02:07:16,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:07:16,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230665104] [2024-11-24 02:07:16,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:16,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:07:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:07:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:07:17,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:07:17,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230665104] [2024-11-24 02:07:17,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230665104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:07:17,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:07:17,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-24 02:07:17,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36636717] [2024-11-24 02:07:17,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:07:17,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-24 02:07:17,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:07:17,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-24 02:07:17,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-11-24 02:07:17,097 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-11-24 02:07:18,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:07:18,455 INFO L93 Difference]: Finished difference Result 621 states and 700 transitions. [2024-11-24 02:07:18,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-24 02:07:18,456 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-11-24 02:07:18,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:07:18,457 INFO L225 Difference]: With dead ends: 621 [2024-11-24 02:07:18,457 INFO L226 Difference]: Without dead ends: 621 [2024-11-24 02:07:18,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2024-11-24 02:07:18,458 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 503 mSDsluCounter, 2486 mSDsCounter, 0 mSdLazyCounter, 2153 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.2s IncrementalHoareTripleChecker+Time [2024-11-24 02:07:18,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 2809 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2153 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-24 02:07:18,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-11-24 02:07:18,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 617. [2024-11-24 02:07:18,466 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-11-24 02:07:18,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 695 transitions. [2024-11-24 02:07:18,466 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 695 transitions. Word has length 103 [2024-11-24 02:07:18,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:07:18,467 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 695 transitions. [2024-11-24 02:07:18,467 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-11-24 02:07:18,467 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 695 transitions. [2024-11-24 02:07:18,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-24 02:07:18,467 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:07:18,467 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:07:18,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-24 02:07:18,468 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-11-24 02:07:18,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:07:18,468 INFO L85 PathProgramCache]: Analyzing trace with hash -679205280, now seen corresponding path program 1 times [2024-11-24 02:07:18,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:07:18,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337205921] [2024-11-24 02:07:18,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:18,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:07:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:07:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:07:19,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:07:19,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337205921] [2024-11-24 02:07:19,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337205921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:07:19,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:07:19,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-24 02:07:19,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561427139] [2024-11-24 02:07:19,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:07:19,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-24 02:07:19,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:07:19,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-24 02:07:19,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-24 02:07:19,799 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-11-24 02:07:22,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:07:22,207 INFO L93 Difference]: Finished difference Result 620 states and 699 transitions. [2024-11-24 02:07:22,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-24 02:07:22,208 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-11-24 02:07:22,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:07:22,209 INFO L225 Difference]: With dead ends: 620 [2024-11-24 02:07:22,209 INFO L226 Difference]: Without dead ends: 620 [2024-11-24 02:07:22,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-24 02:07:22,210 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 481 mSDsluCounter, 2316 mSDsCounter, 0 mSdLazyCounter, 2859 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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, 2.1s IncrementalHoareTripleChecker+Time [2024-11-24 02:07:22,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 2640 Invalid, 2875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2859 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-24 02:07:22,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-24 02:07:22,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 617. [2024-11-24 02:07:22,217 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-11-24 02:07:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 694 transitions. [2024-11-24 02:07:22,219 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 694 transitions. Word has length 103 [2024-11-24 02:07:22,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:07:22,219 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 694 transitions. [2024-11-24 02:07:22,219 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-11-24 02:07:22,220 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 694 transitions. [2024-11-24 02:07:22,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-24 02:07:22,220 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:07:22,221 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-11-24 02:07:22,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-24 02:07:22,221 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-11-24 02:07:22,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:07:22,221 INFO L85 PathProgramCache]: Analyzing trace with hash 910322804, now seen corresponding path program 1 times [2024-11-24 02:07:22,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:07:22,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675639695] [2024-11-24 02:07:22,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:22,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:07:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:07:23,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:07:23,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:07:23,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675639695] [2024-11-24 02:07:23,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675639695] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:07:23,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880050919] [2024-11-24 02:07:23,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:23,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:07:23,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:07:23,162 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:07:23,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-24 02:07:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:07:23,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-24 02:07:23,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:07:23,674 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:07:23,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 02:07:23,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 02:07:23,818 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:07:23,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 02:07:23,890 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:07:23,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 02:07:23,955 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:07:23,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 02:07:24,022 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:07:24,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 02:07:24,107 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:07:24,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 02:07:24,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-24 02:07:24,156 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:07:24,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-24 02:07:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:07:24,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:07:25,238 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-24 02:07:25,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 794 [2024-11-24 02:07:25,265 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-11-24 02:07:25,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880050919] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:07:25,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 02:07:25,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 23 [2024-11-24 02:07:25,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568841800] [2024-11-24 02:07:25,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 02:07:25,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-24 02:07:25,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:07:25,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-24 02:07:25,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=915, Unknown=48, NotChecked=64, Total=1190 [2024-11-24 02:07:25,271 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-11-24 02:07:27,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:07:27,610 INFO L93 Difference]: Finished difference Result 619 states and 698 transitions. [2024-11-24 02:07:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-24 02:07:27,611 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-11-24 02:07:27,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:07:27,613 INFO L225 Difference]: With dead ends: 619 [2024-11-24 02:07:27,613 INFO L226 Difference]: Without dead ends: 619 [2024-11-24 02:07:27,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=267, Invalid=1411, Unknown=48, NotChecked=80, Total=1806 [2024-11-24 02:07:27,614 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 468 mSDsluCounter, 3679 mSDsCounter, 0 mSdLazyCounter, 3092 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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, 2.1s IncrementalHoareTripleChecker+Time [2024-11-24 02:07:27,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 4001 Invalid, 3111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3092 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-24 02:07:27,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-24 02:07:27,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 616. [2024-11-24 02:07:27,624 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-11-24 02:07:27,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 693 transitions. [2024-11-24 02:07:27,626 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 693 transitions. Word has length 104 [2024-11-24 02:07:27,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:07:27,626 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 693 transitions. [2024-11-24 02:07:27,627 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-11-24 02:07:27,627 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 693 transitions. [2024-11-24 02:07:27,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-24 02:07:27,627 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:07:27,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:07:27,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-24 02:07:27,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:07:27,828 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-11-24 02:07:27,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:07:27,829 INFO L85 PathProgramCache]: Analyzing trace with hash 910322805, now seen corresponding path program 1 times [2024-11-24 02:07:27,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:07:27,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602868698] [2024-11-24 02:07:27,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:27,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:07:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:07:29,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:07:29,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:07:29,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602868698] [2024-11-24 02:07:29,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602868698] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:07:29,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640432084] [2024-11-24 02:07:29,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:29,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:07:29,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:07:29,529 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:07:29,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-24 02:07:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:07:29,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-24 02:07:29,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:07:30,025 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:07:30,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 02:07:30,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-24 02:07:30,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 02:07:30,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-24 02:07:30,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-24 02:07:30,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-24 02:07:30,355 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:07:30,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-24 02:07:30,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:07:30,511 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:07:30,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-24 02:07:30,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:07:30,616 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:07:30,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-24 02:07:30,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:07:30,720 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:07:30,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-24 02:07:30,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:07:30,828 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:07:30,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-24 02:07:30,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-11-24 02:07:30,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-24 02:07:30,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-24 02:07:30,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 02:07:30,927 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-24 02:07:30,927 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-11-24 02:07:30,938 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:07:30,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 02:07:30,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:07:30,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:07:54,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 02:07:54,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 604 treesize of output 622 [2024-11-24 02:07:54,791 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-11-24 02:07:54,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640432084] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:07:54,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 02:07:54,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 32 [2024-11-24 02:07:54,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046083877] [2024-11-24 02:07:54,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 02:07:54,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-24 02:07:54,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:07:54,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-24 02:07:54,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1653, Unknown=53, NotChecked=84, Total=1980 [2024-11-24 02:07:54,802 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-11-24 02:08:20,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:08:20,584 INFO L93 Difference]: Finished difference Result 618 states and 697 transitions. [2024-11-24 02:08:20,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-24 02:08:20,585 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-11-24 02:08:20,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:08:20,587 INFO L225 Difference]: With dead ends: 618 [2024-11-24 02:08:20,587 INFO L226 Difference]: Without dead ends: 618 [2024-11-24 02:08:20,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=346, Invalid=2467, Unknown=53, NotChecked=104, Total=2970 [2024-11-24 02:08:20,588 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 903 mSDsluCounter, 3884 mSDsCounter, 0 mSdLazyCounter, 5559 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.0s 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, 23.7s IncrementalHoareTripleChecker+Time [2024-11-24 02:08:20,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 4131 Invalid, 5594 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [35 Valid, 5559 Invalid, 0 Unknown, 0 Unchecked, 23.7s Time] [2024-11-24 02:08:20,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-24 02:08:20,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 596. [2024-11-24 02:08:20,596 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-11-24 02:08:20,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 672 transitions. [2024-11-24 02:08:20,598 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 672 transitions. Word has length 104 [2024-11-24 02:08:20,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:08:20,599 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 672 transitions. [2024-11-24 02:08:20,599 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-11-24 02:08:20,599 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 672 transitions. [2024-11-24 02:08:20,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-24 02:08:20,600 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:08:20,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:08:20,614 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-24 02:08:20,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-24 02:08:20,801 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-11-24 02:08:20,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:08:20,801 INFO L85 PathProgramCache]: Analyzing trace with hash -612948337, now seen corresponding path program 1 times [2024-11-24 02:08:20,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:08:20,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898157043] [2024-11-24 02:08:20,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:08:20,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:08:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:08:22,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:08:22,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:08:22,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898157043] [2024-11-24 02:08:22,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898157043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:08:22,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:08:22,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-24 02:08:22,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270593732] [2024-11-24 02:08:22,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:08:22,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-24 02:08:22,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:08:22,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-24 02:08:22,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-24 02:08:22,478 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-11-24 02:08:36,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:08:36,030 INFO L93 Difference]: Finished difference Result 622 states and 701 transitions. [2024-11-24 02:08:36,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-24 02:08:36,031 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.428571428571429) internal successors, (104), 15 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-24 02:08:36,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:08:36,033 INFO L225 Difference]: With dead ends: 622 [2024-11-24 02:08:36,033 INFO L226 Difference]: Without dead ends: 622 [2024-11-24 02:08:36,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2024-11-24 02:08:36,034 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 503 mSDsluCounter, 3669 mSDsCounter, 0 mSdLazyCounter, 3007 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s 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, 12.8s IncrementalHoareTripleChecker+Time [2024-11-24 02:08:36,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 3994 Invalid, 3020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3007 Invalid, 0 Unknown, 0 Unchecked, 12.8s Time] [2024-11-24 02:08:36,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-11-24 02:08:36,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 618. [2024-11-24 02:08:36,042 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-11-24 02:08:36,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 696 transitions. [2024-11-24 02:08:36,043 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 696 transitions. Word has length 106 [2024-11-24 02:08:36,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:08:36,043 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 696 transitions. [2024-11-24 02:08:36,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.428571428571429) internal successors, (104), 15 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 02:08:36,043 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 696 transitions. [2024-11-24 02:08:36,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-24 02:08:36,044 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:08:36,044 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:08:36,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-24 02:08:36,044 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-11-24 02:08:36,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:08:36,045 INFO L85 PathProgramCache]: Analyzing trace with hash -612948336, now seen corresponding path program 1 times [2024-11-24 02:08:36,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:08:36,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291787803] [2024-11-24 02:08:36,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:08:36,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:08:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:08:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:08:38,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:08:38,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291787803] [2024-11-24 02:08:38,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291787803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:08:38,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:08:38,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-24 02:08:38,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683320008] [2024-11-24 02:08:38,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:08:38,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-24 02:08:38,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:08:38,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-24 02:08:38,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-24 02:08:38,986 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-11-24 02:08:51,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:08:51,666 INFO L93 Difference]: Finished difference Result 621 states and 700 transitions. [2024-11-24 02:08:51,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-24 02:08:51,666 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-11-24 02:08:51,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:08:51,669 INFO L225 Difference]: With dead ends: 621 [2024-11-24 02:08:51,669 INFO L226 Difference]: Without dead ends: 621 [2024-11-24 02:08:51,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-11-24 02:08:51,670 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 502 mSDsluCounter, 2393 mSDsCounter, 0 mSdLazyCounter, 2768 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s 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, 11.5s IncrementalHoareTripleChecker+Time [2024-11-24 02:08:51,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 2716 Invalid, 2784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2768 Invalid, 0 Unknown, 0 Unchecked, 11.5s Time] [2024-11-24 02:08:51,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-11-24 02:08:51,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 618. [2024-11-24 02:08:51,678 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-11-24 02:08:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 695 transitions. [2024-11-24 02:08:51,679 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 695 transitions. Word has length 106 [2024-11-24 02:08:51,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:08:51,679 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 695 transitions. [2024-11-24 02:08:51,680 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-11-24 02:08:51,680 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 695 transitions. [2024-11-24 02:08:51,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-24 02:08:51,680 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:08:51,680 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-11-24 02:08:51,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-24 02:08:51,680 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-11-24 02:08:51,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:08:51,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1003793498, now seen corresponding path program 1 times [2024-11-24 02:08:51,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:08:51,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156330881] [2024-11-24 02:08:51,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:08:51,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:08:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:08:52,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-24 02:08:52,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:08:52,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156330881] [2024-11-24 02:08:52,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156330881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:08:52,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:08:52,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 02:08:52,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145324099] [2024-11-24 02:08:52,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:08:52,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 02:08:52,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:08:52,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 02:08:52,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 02:08:52,480 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-11-24 02:08:55,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:08:55,041 INFO L93 Difference]: Finished difference Result 617 states and 694 transitions. [2024-11-24 02:08:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 02:08:55,042 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-11-24 02:08:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:08:55,043 INFO L225 Difference]: With dead ends: 617 [2024-11-24 02:08:55,043 INFO L226 Difference]: Without dead ends: 617 [2024-11-24 02:08:55,044 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-11-24 02:08:55,044 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 2 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-24 02:08:55,044 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.5s Time] [2024-11-24 02:08:55,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-24 02:08:55,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2024-11-24 02:08:55,053 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-11-24 02:08:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 694 transitions. [2024-11-24 02:08:55,054 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 694 transitions. Word has length 107 [2024-11-24 02:08:55,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:08:55,054 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 694 transitions. [2024-11-24 02:08:55,055 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-11-24 02:08:55,055 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 694 transitions. [2024-11-24 02:08:55,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-24 02:08:55,055 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:08:55,058 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-11-24 02:08:55,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-24 02:08:55,058 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-11-24 02:08:55,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:08:55,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1003793499, now seen corresponding path program 1 times [2024-11-24 02:08:55,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:08:55,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919782548] [2024-11-24 02:08:55,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:08:55,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:08:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:08:58,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:08:58,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:08:58,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919782548] [2024-11-24 02:08:58,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919782548] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:08:58,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387106567] [2024-11-24 02:08:58,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:08:58,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:08:58,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:08:58,182 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:08:58,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-24 02:08:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:08:58,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-24 02:08:58,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:08:59,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-24 02:08:59,047 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:08:59,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 02:08:59,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-24 02:08:59,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 02:08:59,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-24 02:08:59,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-24 02:09:00,276 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:09:00,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-24 02:09:00,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:09:00,711 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:09:00,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-24 02:09:00,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:09:01,198 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:09:01,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-24 02:09:01,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-11-24 02:09:01,699 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:09:01,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-24 02:09:01,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:09:02,120 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:09:02,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-24 02:09:02,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:09:02,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 02:09:02,396 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-11-24 02:09:02,448 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:09:02,448 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-11-24 02:09:02,537 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:09:02,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-24 02:09:02,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:09:02,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-24 02:09:02,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-24 02:09:02,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:09:02,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:09:03,023 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-11-24 02:09:05,034 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 (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_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (<= 0 (+ 40 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2898))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .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_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (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 ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2898))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2901))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 44 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2899) .cse4 v_ArrVal_2900) .cse5 v_ArrVal_2903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_9| v_ArrVal_2902) (select (select (store .cse6 .cse5 v_ArrVal_2904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))))) is different from false [2024-11-24 02:09:05,163 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-11-24 02:09:13,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 02:09:13,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 604 treesize of output 622 [2024-11-24 02:09:14,161 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-11-24 02:09:18,595 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-11-24 02:09:23,458 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-11-24 02:09:23,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387106567] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:09:23,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 02:09:23,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 28 [2024-11-24 02:09:23,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966534015] [2024-11-24 02:09:23,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 02:09:23,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-24 02:09:23,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:09:23,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-24 02:09:23,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1137, Unknown=30, NotChecked=450, Total=1806 [2024-11-24 02:09:23,504 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-11-24 02:09:50,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:09:50,666 INFO L93 Difference]: Finished difference Result 619 states and 698 transitions. [2024-11-24 02:09:50,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-24 02:09:50,667 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-11-24 02:09:50,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:09:50,669 INFO L225 Difference]: With dead ends: 619 [2024-11-24 02:09:50,669 INFO L226 Difference]: Without dead ends: 619 [2024-11-24 02:09:50,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=344, Invalid=2100, Unknown=30, NotChecked=606, Total=3080 [2024-11-24 02:09:50,670 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 490 mSDsluCounter, 2654 mSDsCounter, 0 mSdLazyCounter, 3070 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.4s 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, 23.9s IncrementalHoareTripleChecker+Time [2024-11-24 02:09:50,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 2974 Invalid, 3091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3070 Invalid, 0 Unknown, 0 Unchecked, 23.9s Time] [2024-11-24 02:09:50,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-24 02:09:50,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 594. [2024-11-24 02:09:50,679 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-11-24 02:09:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 670 transitions. [2024-11-24 02:09:50,680 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 670 transitions. Word has length 107 [2024-11-24 02:09:50,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:09:50,680 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 670 transitions. [2024-11-24 02:09:50,680 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-11-24 02:09:50,680 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 670 transitions. [2024-11-24 02:09:50,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-24 02:09:50,681 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:09:50,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:09:50,692 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-24 02:09:50,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-24 02:09:50,882 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-11-24 02:09:50,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:09:50,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1857688454, now seen corresponding path program 1 times [2024-11-24 02:09:50,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:09:50,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492907743] [2024-11-24 02:09:50,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:09:50,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:09:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:09:53,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-11-24 02:09:53,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:09:53,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492907743] [2024-11-24 02:09:53,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492907743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:09:53,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:09:53,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-24 02:09:53,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472602653] [2024-11-24 02:09:53,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:09:53,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-24 02:09:53,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:09:53,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-24 02:09:53,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-24 02:09:53,985 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-11-24 02:10:15,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:10:15,590 INFO L93 Difference]: Finished difference Result 645 states and 726 transitions. [2024-11-24 02:10:15,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-24 02:10:15,592 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-11-24 02:10:15,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:10:15,595 INFO L225 Difference]: With dead ends: 645 [2024-11-24 02:10:15,595 INFO L226 Difference]: Without dead ends: 645 [2024-11-24 02:10:15,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2024-11-24 02:10:15,596 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 513 mSDsluCounter, 2863 mSDsCounter, 0 mSdLazyCounter, 2538 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.5s 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, 19.9s IncrementalHoareTripleChecker+Time [2024-11-24 02:10:15,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 3194 Invalid, 2553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2538 Invalid, 0 Unknown, 0 Unchecked, 19.9s Time] [2024-11-24 02:10:15,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-11-24 02:10:15,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 619. [2024-11-24 02:10:15,603 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-11-24 02:10:15,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 697 transitions. [2024-11-24 02:10:15,605 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 697 transitions. Word has length 109 [2024-11-24 02:10:15,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:10:15,605 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 697 transitions. [2024-11-24 02:10:15,605 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-11-24 02:10:15,605 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 697 transitions. [2024-11-24 02:10:15,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-24 02:10:15,607 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:10:15,607 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:10:15,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-24 02:10:15,607 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-11-24 02:10:15,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:10:15,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1857688455, now seen corresponding path program 1 times [2024-11-24 02:10:15,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:10:15,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110737868] [2024-11-24 02:10:15,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:10:15,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:10:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:10:18,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:10:18,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:10:18,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110737868] [2024-11-24 02:10:18,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110737868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:10:18,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:10:18,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-24 02:10:18,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015127771] [2024-11-24 02:10:18,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:10:18,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-24 02:10:18,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:10:18,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-24 02:10:18,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-24 02:10:18,898 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-11-24 02:10:39,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:10:39,113 INFO L93 Difference]: Finished difference Result 644 states and 725 transitions. [2024-11-24 02:10:39,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-24 02:10:39,114 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-11-24 02:10:39,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:10:39,117 INFO L225 Difference]: With dead ends: 644 [2024-11-24 02:10:39,117 INFO L226 Difference]: Without dead ends: 644 [2024-11-24 02:10:39,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2024-11-24 02:10:39,118 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 532 mSDsluCounter, 2374 mSDsCounter, 0 mSdLazyCounter, 2483 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s 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, 18.6s IncrementalHoareTripleChecker+Time [2024-11-24 02:10:39,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 2701 Invalid, 2499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2483 Invalid, 0 Unknown, 0 Unchecked, 18.6s Time] [2024-11-24 02:10:39,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-11-24 02:10:39,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 619. [2024-11-24 02:10:39,125 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-11-24 02:10:39,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 696 transitions. [2024-11-24 02:10:39,126 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 696 transitions. Word has length 109 [2024-11-24 02:10:39,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:10:39,126 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 696 transitions. [2024-11-24 02:10:39,126 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-11-24 02:10:39,126 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 696 transitions. [2024-11-24 02:10:39,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-24 02:10:39,127 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:10:39,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:10:39,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-24 02:10:39,127 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-11-24 02:10:39,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:10:39,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1844529701, now seen corresponding path program 1 times [2024-11-24 02:10:39,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:10:39,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422036113] [2024-11-24 02:10:39,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:10:39,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:10:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:10:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:10:42,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:10:42,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422036113] [2024-11-24 02:10:42,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422036113] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:10:42,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046749800] [2024-11-24 02:10:42,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:10:42,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:10:42,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:10:42,515 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:10:42,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-24 02:10:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:10:42,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-24 02:10:42,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:10:43,862 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:10:43,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 02:10:43,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 02:10:44,259 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:10:44,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-11-24 02:10:44,654 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:10:44,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-24 02:10:45,076 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:10:45,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-24 02:10:45,494 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:10:45,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-24 02:10:45,908 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:10:45,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-24 02:10:46,257 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:10:46,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 31 treesize of output 32 [2024-11-24 02:10:46,701 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:10:46,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 02:10:46,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-24 02:10:46,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-11-24 02:10:46,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:10:46,914 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-24 02:10:46,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-24 02:10:46,942 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-11-24 02:10:47,101 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3290 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3290) |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-11-24 02:10:47,154 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3290 (Array Int Int))) (not (= (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_3290) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-24 02:10:47,208 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3290 (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~mem56#1.base| v_ArrVal_3289))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3290)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-24 02:10:47,244 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3290 (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| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3289))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3290)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-24 02:10:47,300 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3290 (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~mem55#1.base| v_ArrVal_3288))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3289)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3290)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-24 02:10:47,341 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3290 (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| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3288))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3289)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3290)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-24 02:10:52,213 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3286 (Array Int Int)) (v_ArrVal_3287 (Array Int Int)) (v_ArrVal_3288 (Array Int Int)) (v_ArrVal_3289 (Array Int Int)) (v_ArrVal_3290 (Array Int Int))) (not (= (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~mem53#1.base| v_ArrVal_3286))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3287)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3288)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3289)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3290)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-24 02:10:57,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046749800] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:10:57,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 02:10:57,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 23 [2024-11-24 02:10:57,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236609215] [2024-11-24 02:10:57,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 02:10:57,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-24 02:10:57,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:10:57,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-24 02:10:57,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=640, Unknown=28, NotChecked=472, Total=1260 [2024-11-24 02:10:57,557 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-11-24 02:11:31,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:11:31,653 INFO L93 Difference]: Finished difference Result 635 states and 714 transitions. [2024-11-24 02:11:31,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-24 02:11:31,653 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-11-24 02:11:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:11:31,656 INFO L225 Difference]: With dead ends: 635 [2024-11-24 02:11:31,656 INFO L226 Difference]: Without dead ends: 635 [2024-11-24 02:11:31,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=228, Invalid=1258, Unknown=28, NotChecked=648, Total=2162 [2024-11-24 02:11:31,658 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 506 mSDsluCounter, 5205 mSDsCounter, 0 mSdLazyCounter, 4159 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.4s 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, 32.0s IncrementalHoareTripleChecker+Time [2024-11-24 02:11:31,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 5528 Invalid, 4181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 4159 Invalid, 0 Unknown, 0 Unchecked, 32.0s Time] [2024-11-24 02:11:31,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-24 02:11:31,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 618. [2024-11-24 02:11:31,664 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-11-24 02:11:31,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 695 transitions. [2024-11-24 02:11:31,666 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 695 transitions. Word has length 110 [2024-11-24 02:11:31,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:11:31,666 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 695 transitions. [2024-11-24 02:11:31,666 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-11-24 02:11:31,666 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 695 transitions. [2024-11-24 02:11:31,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-24 02:11:31,667 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:11:31,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:11:31,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-24 02:11:31,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-24 02:11:31,868 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-11-24 02:11:31,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:11:31,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1844529700, now seen corresponding path program 1 times [2024-11-24 02:11:31,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:11:31,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903800336] [2024-11-24 02:11:31,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:11:31,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:11:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:11:35,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:11:35,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:11:35,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903800336] [2024-11-24 02:11:35,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903800336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:11:35,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013239449] [2024-11-24 02:11:35,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:11:35,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:11:35,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:11:35,744 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:11:35,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-24 02:11:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:11:36,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-24 02:11:36,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:11:37,108 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:11:37,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 02:11:37,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 02:11:37,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 02:11:38,236 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:11:38,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 02:11:38,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:11:38,722 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:11:38,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 02:11:38,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:11:39,208 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:11:39,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 51 treesize of output 48 [2024-11-24 02:11:39,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:11:39,720 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:11:39,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 02:11:39,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:11:40,264 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:11:40,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 02:11:40,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 [2024-11-24 02:11:40,908 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:11:40,908 INFO L378 Elim1Store]: Elim1 eliminated variable 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-11-24 02:11:40,926 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-11-24 02:11:41,962 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:11:41,962 INFO L378 Elim1Store]: Elim1 eliminated variable 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-11-24 02:11:41,980 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-11-24 02:11:42,098 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-11-24 02:11:42,116 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-11-24 02:11:42,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:11:42,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:11:42,832 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-11-24 02:11:43,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 02:11:43,504 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-11-24 02:11:44,374 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-11-24 02:11:44,518 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-11-24 02:11:44,835 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-11-24 02:11:45,036 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-11-24 02:11:45,306 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-11-24 02:11:45,648 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-11-24 02:11:45,857 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-11-24 02:11:46,802 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-11-24 02:11:47,948 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-11-24 02:11:52,390 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-11-24 02:11:52,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013239449] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:11:52,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 02:11:52,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2024-11-24 02:11:52,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334681537] [2024-11-24 02:11:52,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 02:11:52,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-24 02:11:52,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:11:52,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-24 02:11:52,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=882, Unknown=35, NotChecked=770, Total=1806 [2024-11-24 02:11:52,408 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-11-24 02:12:29,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:12:29,879 INFO L93 Difference]: Finished difference Result 634 states and 713 transitions. [2024-11-24 02:12:29,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-24 02:12:29,879 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-11-24 02:12:29,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:12:29,882 INFO L225 Difference]: With dead ends: 634 [2024-11-24 02:12:29,882 INFO L226 Difference]: Without dead ends: 634 [2024-11-24 02:12:29,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=240, Invalid=1661, Unknown=35, NotChecked=1034, Total=2970 [2024-11-24 02:12:29,883 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 548 mSDsluCounter, 4987 mSDsCounter, 0 mSdLazyCounter, 4517 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 5305 SdHoareTripleChecker+Invalid, 4544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 4517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.1s IncrementalHoareTripleChecker+Time [2024-11-24 02:12:29,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 5305 Invalid, 4544 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 4517 Invalid, 0 Unknown, 0 Unchecked, 34.1s Time] [2024-11-24 02:12:29,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-24 02:12:29,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 592. [2024-11-24 02:12:29,891 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-11-24 02:12:29,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 668 transitions. [2024-11-24 02:12:29,892 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 668 transitions. Word has length 110 [2024-11-24 02:12:29,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:12:29,892 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 668 transitions. [2024-11-24 02:12:29,892 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-11-24 02:12:29,892 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 668 transitions. [2024-11-24 02:12:29,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-24 02:12:29,893 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:12:29,893 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-11-24 02:12:29,902 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-24 02:12:30,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:12:30,094 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-11-24 02:12:30,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:12:30,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1743797443, now seen corresponding path program 1 times [2024-11-24 02:12:30,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:12:30,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169324458] [2024-11-24 02:12:30,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:12:30,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:12:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:12:30,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:12:30,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:12:30,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169324458] [2024-11-24 02:12:30,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169324458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:12:30,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:12:30,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 02:12:30,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586807294] [2024-11-24 02:12:30,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:12:30,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 02:12:30,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:12:30,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 02:12:30,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 02:12:30,349 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-11-24 02:12:34,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:12:34,697 INFO L93 Difference]: Finished difference Result 591 states and 667 transitions. [2024-11-24 02:12:34,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 02:12:34,698 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-11-24 02:12:34,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:12:34,699 INFO L225 Difference]: With dead ends: 591 [2024-11-24 02:12:34,699 INFO L226 Difference]: Without dead ends: 591 [2024-11-24 02:12:34,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-24 02:12:34,700 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 5 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s 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, 4.3s IncrementalHoareTripleChecker+Time [2024-11-24 02:12:34,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1571 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-24 02:12:34,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-11-24 02:12:34,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2024-11-24 02:12:34,708 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-11-24 02:12:34,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 667 transitions. [2024-11-24 02:12:34,711 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 667 transitions. Word has length 112 [2024-11-24 02:12:34,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:12:34,711 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 667 transitions. [2024-11-24 02:12:34,711 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-11-24 02:12:34,712 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 667 transitions. [2024-11-24 02:12:34,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-24 02:12:34,712 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:12:34,712 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-11-24 02:12:34,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-24 02:12:34,713 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-11-24 02:12:34,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:12:34,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1743797444, now seen corresponding path program 1 times [2024-11-24 02:12:34,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:12:34,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851163035] [2024-11-24 02:12:34,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:12:34,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:12:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:12:35,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:12:35,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:12:35,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851163035] [2024-11-24 02:12:35,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851163035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:12:35,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:12:35,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 02:12:35,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925719586] [2024-11-24 02:12:35,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:12:35,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 02:12:35,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:12:35,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 02:12:35,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 02:12:35,157 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-11-24 02:12:39,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:12:39,504 INFO L93 Difference]: Finished difference Result 590 states and 666 transitions. [2024-11-24 02:12:39,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 02:12:39,504 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-11-24 02:12:39,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:12:39,506 INFO L225 Difference]: With dead ends: 590 [2024-11-24 02:12:39,506 INFO L226 Difference]: Without dead ends: 590 [2024-11-24 02:12:39,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-24 02:12:39,506 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 4 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s 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, 4.2s IncrementalHoareTripleChecker+Time [2024-11-24 02:12:39,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1577 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-24 02:12:39,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-11-24 02:12:39,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2024-11-24 02:12:39,515 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-11-24 02:12:39,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 666 transitions. [2024-11-24 02:12:39,517 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 666 transitions. Word has length 112 [2024-11-24 02:12:39,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:12:39,520 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 666 transitions. [2024-11-24 02:12:39,520 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-11-24 02:12:39,521 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 666 transitions. [2024-11-24 02:12:39,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-24 02:12:39,521 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:12:39,522 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-11-24 02:12:39,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-24 02:12:39,522 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-11-24 02:12:39,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:12:39,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1776853430, now seen corresponding path program 1 times [2024-11-24 02:12:39,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:12:39,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000453810] [2024-11-24 02:12:39,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:12:39,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:12:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:12:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:12:43,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:12:43,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000453810] [2024-11-24 02:12:43,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000453810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:12:43,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:12:43,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-24 02:12:43,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969517296] [2024-11-24 02:12:43,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:12:43,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-24 02:12:43,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:12:43,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-24 02:12:43,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-24 02:12:43,711 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-11-24 02:13:11,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:13:11,676 INFO L93 Difference]: Finished difference Result 638 states and 719 transitions. [2024-11-24 02:13:11,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-24 02:13:11,677 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-11-24 02:13:11,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:13:11,678 INFO L225 Difference]: With dead ends: 638 [2024-11-24 02:13:11,679 INFO L226 Difference]: Without dead ends: 638 [2024-11-24 02:13:11,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2024-11-24 02:13:11,680 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 515 mSDsluCounter, 4277 mSDsCounter, 0 mSdLazyCounter, 3466 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 4598 SdHoareTripleChecker+Invalid, 3485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.8s IncrementalHoareTripleChecker+Time [2024-11-24 02:13:11,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 4598 Invalid, 3485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3466 Invalid, 0 Unknown, 0 Unchecked, 25.8s Time] [2024-11-24 02:13:11,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-24 02:13:11,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 619. [2024-11-24 02:13:11,687 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-11-24 02:13:11,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 698 transitions. [2024-11-24 02:13:11,688 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 698 transitions. Word has length 113 [2024-11-24 02:13:11,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:13:11,688 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 698 transitions. [2024-11-24 02:13:11,688 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-11-24 02:13:11,688 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 698 transitions. [2024-11-24 02:13:11,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-24 02:13:11,689 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:13:11,689 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-11-24 02:13:11,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-24 02:13:11,689 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-11-24 02:13:11,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:13:11,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1776853429, now seen corresponding path program 1 times [2024-11-24 02:13:11,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:13:11,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394671707] [2024-11-24 02:13:11,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:13:11,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:13:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:13:16,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:13:16,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:13:16,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394671707] [2024-11-24 02:13:16,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394671707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:13:16,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:13:16,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-24 02:13:16,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840232055] [2024-11-24 02:13:16,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:13:16,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-24 02:13:16,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:13:16,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-24 02:13:16,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-11-24 02:13:16,357 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-11-24 02:13:46,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:13:46,330 INFO L93 Difference]: Finished difference Result 637 states and 718 transitions. [2024-11-24 02:13:46,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-24 02:13:46,331 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-11-24 02:13:46,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:13:46,333 INFO L225 Difference]: With dead ends: 637 [2024-11-24 02:13:46,333 INFO L226 Difference]: Without dead ends: 637 [2024-11-24 02:13:46,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2024-11-24 02:13:46,334 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 530 mSDsluCounter, 3395 mSDsCounter, 0 mSdLazyCounter, 3305 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 3717 SdHoareTripleChecker+Invalid, 3324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.4s IncrementalHoareTripleChecker+Time [2024-11-24 02:13:46,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 3717 Invalid, 3324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3305 Invalid, 0 Unknown, 0 Unchecked, 27.4s Time] [2024-11-24 02:13:46,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-24 02:13:46,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 619. [2024-11-24 02:13:46,342 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-11-24 02:13:46,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 697 transitions. [2024-11-24 02:13:46,344 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 697 transitions. Word has length 113 [2024-11-24 02:13:46,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:13:46,344 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 697 transitions. [2024-11-24 02:13:46,344 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-11-24 02:13:46,344 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 697 transitions. [2024-11-24 02:13:46,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-24 02:13:46,345 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:13:46,345 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-11-24 02:13:46,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-24 02:13:46,346 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-11-24 02:13:46,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:13:46,346 INFO L85 PathProgramCache]: Analyzing trace with hash -554119649, now seen corresponding path program 1 times [2024-11-24 02:13:46,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:13:46,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219663545] [2024-11-24 02:13:46,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:13:46,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:13:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:13:51,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:13:51,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:13:51,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219663545] [2024-11-24 02:13:51,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219663545] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:13:51,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317377393] [2024-11-24 02:13:51,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:13:51,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:13:51,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:13:51,595 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:13:51,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-24 02:13:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:13:52,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-24 02:13:52,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:13:53,255 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:13:53,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 02:13:53,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 02:13:53,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 02:13:54,496 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:13:54,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 02:13:54,515 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-11-24 02:13:54,972 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:13:54,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 02:13:54,991 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-11-24 02:13:55,462 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:13:55,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 02:13:55,482 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-11-24 02:13:55,974 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:13:55,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 02:13:56,008 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-11-24 02:13:56,505 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:13:56,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 51 treesize of output 48 [2024-11-24 02:13:56,524 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-11-24 02:13:57,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-24 02:13:57,553 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-24 02:13:57,553 INFO L378 Elim1Store]: Elim1 eliminated variable 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-11-24 02:13:57,571 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-11-24 02:13:58,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 02:13:58,598 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-24 02:13:58,598 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-11-24 02:13:58,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2024-11-24 02:13:58,805 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-11-24 02:13:59,231 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-24 02:13:59,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 16 [2024-11-24 02:13:59,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:13:59,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:13:59,418 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-11-24 02:13:59,499 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-11-24 02:13:59,725 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-11-24 02:13:59,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 272 treesize of output 184 [2024-11-24 02:13:59,905 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-11-24 02:14:00,077 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-11-24 02:14:00,451 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-11-24 02:14:00,696 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-11-24 02:14:01,335 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-11-24 02:14:01,588 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-11-24 02:14:02,050 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-11-24 02:14:02,242 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-11-24 02:14:02,598 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-11-24 02:14:02,810 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-11-24 02:14:03,483 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-11-24 02:14:03,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317377393] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:14:03,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 02:14:03,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 32 [2024-11-24 02:14:03,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597461867] [2024-11-24 02:14:03,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 02:14:03,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-24 02:14:03,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:14:03,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-24 02:14:03,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=962, Unknown=14, NotChecked=1050, Total=2162 [2024-11-24 02:14:03,498 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-11-24 02:14:33,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:14:33,918 INFO L93 Difference]: Finished difference Result 635 states and 716 transitions. [2024-11-24 02:14:33,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-24 02:14:33,919 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-11-24 02:14:33,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:14:33,921 INFO L225 Difference]: With dead ends: 635 [2024-11-24 02:14:33,922 INFO L226 Difference]: Without dead ends: 635 [2024-11-24 02:14:33,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=254, Invalid=1950, Unknown=14, NotChecked=1442, Total=3660 [2024-11-24 02:14:33,923 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 546 mSDsluCounter, 3808 mSDsCounter, 0 mSdLazyCounter, 3258 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 4129 SdHoareTripleChecker+Invalid, 3283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 3258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.7s IncrementalHoareTripleChecker+Time [2024-11-24 02:14:33,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 4129 Invalid, 3283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 3258 Invalid, 0 Unknown, 0 Unchecked, 26.7s Time] [2024-11-24 02:14:33,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-24 02:14:33,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 618. [2024-11-24 02:14:33,933 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-11-24 02:14:33,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 696 transitions. [2024-11-24 02:14:33,935 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 696 transitions. Word has length 114 [2024-11-24 02:14:33,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:14:33,936 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 696 transitions. [2024-11-24 02:14:33,936 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-11-24 02:14:33,936 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 696 transitions. [2024-11-24 02:14:33,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-24 02:14:33,937 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:14:33,937 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-11-24 02:14:33,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-24 02:14:34,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-11-24 02:14:34,138 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-11-24 02:14:34,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:14:34,139 INFO L85 PathProgramCache]: Analyzing trace with hash -554119648, now seen corresponding path program 1 times [2024-11-24 02:14:34,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:14:34,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156566332] [2024-11-24 02:14:34,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:14:34,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:14:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:14:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:14:40,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:14:40,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156566332] [2024-11-24 02:14:40,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156566332] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:14:40,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372956570] [2024-11-24 02:14:40,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:14:40,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:14:40,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:14:40,251 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:14:40,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-24 02:14:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:14:40,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-24 02:14:40,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:14:42,041 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:14:42,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 02:14:42,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 02:14:42,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 02:14:43,279 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:14:43,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 02:14:43,298 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-11-24 02:14:43,766 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:14:43,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 02:14:43,787 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-11-24 02:14:44,277 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:14:44,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 02:14:44,317 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-11-24 02:14:44,989 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:14:44,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 02:14:45,039 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-11-24 02:14:45,550 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:14:45,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 02:14:45,568 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-11-24 02:14:46,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-24 02:14:46,890 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-24 02:14:46,890 INFO L378 Elim1Store]: Elim1 eliminated variable 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-11-24 02:14:46,923 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-11-24 02:14:48,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 02:14:48,398 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-24 02:14:48,399 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-11-24 02:14:48,528 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-24 02:14:48,529 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-11-24 02:14:49,973 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-24 02:14:49,973 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-11-24 02:14:50,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:14:50,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:14:52,503 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-11-24 02:14:52,770 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-11-24 02:14:53,213 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-11-24 02:14:53,270 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-11-24 02:14:54,226 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-11-24 02:14:56,414 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-11-24 02:14:57,574 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-11-24 02:15:01,037 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-11-24 02:15:03,626 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-11-24 02:15:23,073 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-11-24 02:15:24,081 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-11-24 02:15:25,126 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-11-24 02:15:26,081 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-11-24 02:15:27,722 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-11-24 02:15:28,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372956570] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:15:28,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 02:15:28,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 34 [2024-11-24 02:15:28,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510087134] [2024-11-24 02:15:28,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 02:15:28,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-24 02:15:28,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:15:28,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-24 02:15:28,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1345, Unknown=13, NotChecked=1118, Total=2652 [2024-11-24 02:15:28,104 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-11-24 02:16:23,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:16:23,448 INFO L93 Difference]: Finished difference Result 634 states and 715 transitions. [2024-11-24 02:16:23,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-24 02:16:23,448 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-11-24 02:16:23,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:16:23,451 INFO L225 Difference]: With dead ends: 634 [2024-11-24 02:16:23,451 INFO L226 Difference]: Without dead ends: 634 [2024-11-24 02:16:23,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 41.8s TimeCoverageRelationStatistics Valid=328, Invalid=2573, Unknown=13, NotChecked=1508, Total=4422 [2024-11-24 02:16:23,452 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 489 mSDsluCounter, 6339 mSDsCounter, 0 mSdLazyCounter, 6346 mSolverCounterSat, 22 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 6657 SdHoareTripleChecker+Invalid, 6370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 6346 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.5s IncrementalHoareTripleChecker+Time [2024-11-24 02:16:23,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 6657 Invalid, 6370 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 6346 Invalid, 2 Unknown, 0 Unchecked, 50.5s Time] [2024-11-24 02:16:23,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-24 02:16:23,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 588. [2024-11-24 02:16:23,460 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-11-24 02:16:23,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 664 transitions. [2024-11-24 02:16:23,461 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 664 transitions. Word has length 114 [2024-11-24 02:16:23,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:16:23,461 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 664 transitions. [2024-11-24 02:16:23,461 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-11-24 02:16:23,461 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 664 transitions. [2024-11-24 02:16:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-24 02:16:23,462 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:16:23,462 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-11-24 02:16:23,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-24 02:16:23,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2024-11-24 02:16:23,663 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-11-24 02:16:23,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:16:23,663 INFO L85 PathProgramCache]: Analyzing trace with hash -655482028, now seen corresponding path program 1 times [2024-11-24 02:16:23,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:16:23,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427049224] [2024-11-24 02:16:23,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:16:23,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:16:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:16:23,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-24 02:16:23,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:16:23,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427049224] [2024-11-24 02:16:23,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427049224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:16:23,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:16:23,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 02:16:23,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169581070] [2024-11-24 02:16:23,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:16:23,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 02:16:23,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:16:23,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 02:16:23,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 02:16:23,879 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-11-24 02:16:26,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:16:26,836 INFO L93 Difference]: Finished difference Result 691 states and 799 transitions. [2024-11-24 02:16:26,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 02:16:26,837 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-11-24 02:16:26,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:16:26,839 INFO L225 Difference]: With dead ends: 691 [2024-11-24 02:16:26,839 INFO L226 Difference]: Without dead ends: 691 [2024-11-24 02:16:26,839 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-11-24 02:16:26,840 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 887 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s 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.9s IncrementalHoareTripleChecker+Time [2024-11-24 02:16:26,840 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.9s Time] [2024-11-24 02:16:26,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-11-24 02:16:26,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 691. [2024-11-24 02:16:26,850 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-11-24 02:16:26,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 799 transitions. [2024-11-24 02:16:26,852 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 799 transitions. Word has length 123 [2024-11-24 02:16:26,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:16:26,852 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 799 transitions. [2024-11-24 02:16:26,853 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-11-24 02:16:26,853 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 799 transitions. [2024-11-24 02:16:26,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-24 02:16:26,853 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:16:26,853 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-11-24 02:16:26,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-24 02:16:26,854 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-11-24 02:16:26,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:16:26,854 INFO L85 PathProgramCache]: Analyzing trace with hash -655482027, now seen corresponding path program 1 times [2024-11-24 02:16:26,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:16:26,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623662247] [2024-11-24 02:16:26,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:16:26,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:16:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:16:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-24 02:16:27,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:16:27,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623662247] [2024-11-24 02:16:27,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623662247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:16:27,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:16:27,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 02:16:27,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051673923] [2024-11-24 02:16:27,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:16:27,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 02:16:27,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:16:27,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 02:16:27,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-24 02:16:27,253 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-11-24 02:16:31,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:16:31,302 INFO L93 Difference]: Finished difference Result 902 states and 1046 transitions. [2024-11-24 02:16:31,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 02:16:31,302 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-11-24 02:16:31,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:16:31,304 INFO L225 Difference]: With dead ends: 902 [2024-11-24 02:16:31,304 INFO L226 Difference]: Without dead ends: 902 [2024-11-24 02:16:31,305 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-11-24 02:16:31,305 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 1345 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s 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.9s IncrementalHoareTripleChecker+Time [2024-11-24 02:16:31,305 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.9s Time] [2024-11-24 02:16:31,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-11-24 02:16:31,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 856. [2024-11-24 02:16:31,317 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-11-24 02:16:31,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1037 transitions. [2024-11-24 02:16:31,320 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1037 transitions. Word has length 123 [2024-11-24 02:16:31,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:16:31,320 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1037 transitions. [2024-11-24 02:16:31,320 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-11-24 02:16:31,320 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1037 transitions. [2024-11-24 02:16:31,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-24 02:16:31,321 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:16:31,322 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-11-24 02:16:31,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-24 02:16:31,322 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-11-24 02:16:31,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:16:31,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1154894375, now seen corresponding path program 1 times [2024-11-24 02:16:31,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:16:31,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216772944] [2024-11-24 02:16:31,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:16:31,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:16:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:16:31,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-24 02:16:31,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:16:31,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216772944] [2024-11-24 02:16:31,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216772944] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:16:31,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475586942] [2024-11-24 02:16:31,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:16:31,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:16:31,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:16:31,822 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:16:31,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-24 02:16:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:16:32,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-24 02:16:32,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:16:33,497 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:16:33,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 02:16:33,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-11-24 02:16:34,496 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:16:34,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-24 02:16:34,848 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:16:34,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-24 02:16:35,197 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:16:35,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-24 02:16:35,561 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:16:35,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-24 02:16:35,972 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:16:35,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 02:16:36,685 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:16:36,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 42 treesize of output 41 [2024-11-24 02:16:36,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-24 02:16:38,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-24 02:16:38,315 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:16:38,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 02:16:38,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475586942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:16:38,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 02:16:38,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [4] total 20 [2024-11-24 02:16:38,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929321940] [2024-11-24 02:16:38,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:16:38,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-24 02:16:38,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:16:38,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-24 02:16:38,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2024-11-24 02:16:38,317 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-11-24 02:17:02,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:17:02,951 INFO L93 Difference]: Finished difference Result 897 states and 1082 transitions. [2024-11-24 02:17:02,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-24 02:17:02,951 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-11-24 02:17:02,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:17:02,953 INFO L225 Difference]: With dead ends: 897 [2024-11-24 02:17:02,953 INFO L226 Difference]: Without dead ends: 897 [2024-11-24 02:17:02,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2024-11-24 02:17:02,954 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 510 mSDsluCounter, 3413 mSDsCounter, 0 mSdLazyCounter, 2821 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 3735 SdHoareTripleChecker+Invalid, 2841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2024-11-24 02:17:02,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 3735 Invalid, 2841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2821 Invalid, 0 Unknown, 0 Unchecked, 22.2s Time] [2024-11-24 02:17:02,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2024-11-24 02:17:02,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 893. [2024-11-24 02:17:02,966 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-11-24 02:17:02,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1079 transitions. [2024-11-24 02:17:02,968 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1079 transitions. Word has length 124 [2024-11-24 02:17:02,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:17:02,969 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1079 transitions. [2024-11-24 02:17:02,969 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-11-24 02:17:02,969 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1079 transitions. [2024-11-24 02:17:02,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-24 02:17:02,970 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:17:02,970 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-11-24 02:17:02,985 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-24 02:17:03,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2024-11-24 02:17:03,171 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-11-24 02:17:03,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:17:03,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1154894376, now seen corresponding path program 1 times [2024-11-24 02:17:03,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:17:03,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560880822] [2024-11-24 02:17:03,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:17:03,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:17:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:17:03,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-24 02:17:03,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:17:03,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560880822] [2024-11-24 02:17:03,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560880822] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:17:03,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072734471] [2024-11-24 02:17:03,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:17:03,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:17:03,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:17:03,596 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:17:03,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-24 02:17:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:17:04,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-24 02:17:04,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:17:06,675 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:17:06,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 02:17:06,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 02:17:06,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 02:17:08,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 02:17:08,182 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-11-24 02:17:08,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:17:08,703 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:17:08,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 51 treesize of output 48 [2024-11-24 02:17:08,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:17:09,210 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:17:09,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 02:17:09,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:17:09,766 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:17:09,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 02:17:09,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:17:10,379 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:17:10,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 02:17:10,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:17:11,008 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:17:11,008 INFO L378 Elim1Store]: Elim1 eliminated variable 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-11-24 02:17:11,031 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-11-24 02:17:11,963 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-11-24 02:17:11,980 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-11-24 02:17:13,239 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-11-24 02:17:13,255 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-11-24 02:17:13,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:17:13,502 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 02:17:13,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072734471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:17:13,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 02:17:13,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [4] total 21 [2024-11-24 02:17:13,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472135842] [2024-11-24 02:17:13,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:17:13,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-24 02:17:13,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:17:13,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-24 02:17:13,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-11-24 02:17:13,503 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-11-24 02:17:39,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:17:39,967 INFO L93 Difference]: Finished difference Result 922 states and 1109 transitions. [2024-11-24 02:17:39,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-24 02:17:39,968 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-11-24 02:17:39,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:17:39,969 INFO L225 Difference]: With dead ends: 922 [2024-11-24 02:17:39,970 INFO L226 Difference]: Without dead ends: 922 [2024-11-24 02:17:39,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2024-11-24 02:17:39,970 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 1045 mSDsluCounter, 3155 mSDsCounter, 0 mSdLazyCounter, 2950 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 3476 SdHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.5s IncrementalHoareTripleChecker+Time [2024-11-24 02:17:39,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 3476 Invalid, 2971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2950 Invalid, 0 Unknown, 0 Unchecked, 23.5s Time] [2024-11-24 02:17:39,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-11-24 02:17:39,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 900. [2024-11-24 02:17:39,984 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-11-24 02:17:39,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1085 transitions. [2024-11-24 02:17:39,989 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1085 transitions. Word has length 124 [2024-11-24 02:17:39,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:17:39,989 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1085 transitions. [2024-11-24 02:17:39,989 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-11-24 02:17:39,990 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1085 transitions. [2024-11-24 02:17:39,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-24 02:17:39,991 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:17:39,991 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-11-24 02:17:40,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-24 02:17:40,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:17:40,192 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-11-24 02:17:40,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:17:40,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1026026702, now seen corresponding path program 1 times [2024-11-24 02:17:40,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:17:40,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468682393] [2024-11-24 02:17:40,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:17:40,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:17:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:17:40,847 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-24 02:17:40,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:17:40,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468682393] [2024-11-24 02:17:40,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468682393] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:17:40,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714448381] [2024-11-24 02:17:40,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:17:40,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:17:40,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:17:40,853 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:17:40,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-24 02:17:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:17:41,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-24 02:17:41,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:17:42,744 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:17:42,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 02:17:42,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 02:17:43,683 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:17:43,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-24 02:17:44,012 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:17:44,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-24 02:17:44,394 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:17:44,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-24 02:17:44,747 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:17:44,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-24 02:17:45,120 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:17:45,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-24 02:17:45,544 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:17:45,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 02:17:46,273 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:17:46,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-24 02:17:46,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-24 02:17:47,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-24 02:17:47,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:17:47,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:17:49,954 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-24 02:17:49,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-24 02:17:49,987 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-11-24 02:17:50,505 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5066 (Array Int Int)) (v_ArrVal_5068 (Array Int Int)) (v_ArrVal_5067 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_5066)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 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) .cse3)))) is different from false [2024-11-24 02:17:50,552 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5066 (Array Int Int)) (v_ArrVal_5068 (Array Int Int)) (v_ArrVal_5067 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5066))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 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) .cse3))))) is different from false [2024-11-24 02:17:51,814 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5066 (Array Int Int)) (v_ArrVal_5065 (Array Int Int)) (v_ArrVal_5068 (Array Int Int)) (v_ArrVal_5067 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5065))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5066)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 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) .cse3))))) is different from false [2024-11-24 02:17:52,007 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5066 (Array Int Int)) (v_ArrVal_5065 (Array Int Int)) (v_ArrVal_5068 (Array Int Int)) (v_ArrVal_5067 (Array Int Int)) (v_ArrVal_5064 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_5064))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5065)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5066)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 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) .cse3))))) is different from false [2024-11-24 02:17:54,730 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5066 (Array Int Int)) (v_ArrVal_5065 (Array Int Int)) (v_ArrVal_5068 (Array Int Int)) (v_ArrVal_5067 (Array Int Int)) (v_ArrVal_5064 (Array Int Int)) (v_ArrVal_5063 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_5063))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5064)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5065)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5066)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 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) .cse3))))) is different from false [2024-11-24 02:18:37,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714448381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:18:37,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 02:18:37,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 18] total 22 [2024-11-24 02:18:37,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529764556] [2024-11-24 02:18:37,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 02:18:37,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-24 02:18:37,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:18:37,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-24 02:18:37,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=826, Unknown=65, NotChecked=390, Total=1406 [2024-11-24 02:18:37,698 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-11-24 02:19:08,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:19:08,268 INFO L93 Difference]: Finished difference Result 874 states and 1056 transitions. [2024-11-24 02:19:08,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-24 02:19:08,269 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-11-24 02:19:08,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:19:08,271 INFO L225 Difference]: With dead ends: 874 [2024-11-24 02:19:08,271 INFO L226 Difference]: Without dead ends: 870 [2024-11-24 02:19:08,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 60.7s TimeCoverageRelationStatistics Valid=304, Invalid=2099, Unknown=71, NotChecked=606, Total=3080 [2024-11-24 02:19:08,273 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 496 mSDsluCounter, 3398 mSDsCounter, 0 mSdLazyCounter, 2816 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 3715 SdHoareTripleChecker+Invalid, 2842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.1s IncrementalHoareTripleChecker+Time [2024-11-24 02:19:08,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 3715 Invalid, 2842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2816 Invalid, 0 Unknown, 0 Unchecked, 22.1s Time] [2024-11-24 02:19:08,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-11-24 02:19:08,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 866. [2024-11-24 02:19:08,283 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-11-24 02:19:08,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1049 transitions. [2024-11-24 02:19:08,285 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1049 transitions. Word has length 125 [2024-11-24 02:19:08,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:19:08,286 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1049 transitions. [2024-11-24 02:19:08,286 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-11-24 02:19:08,286 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1049 transitions. [2024-11-24 02:19:08,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-24 02:19:08,287 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:19:08,287 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-11-24 02:19:08,303 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-24 02:19:08,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2024-11-24 02:19:08,488 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-11-24 02:19:08,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:19:08,488 INFO L85 PathProgramCache]: Analyzing trace with hash 84896648, now seen corresponding path program 1 times [2024-11-24 02:19:08,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:19:08,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713906121] [2024-11-24 02:19:08,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:19:08,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:19:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:19:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-24 02:19:09,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:19:09,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713906121] [2024-11-24 02:19:09,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713906121] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:19:09,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336705813] [2024-11-24 02:19:09,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:19:09,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:19:09,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:19:09,302 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:19:09,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-24 02:19:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:19:09,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-24 02:19:09,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:19:12,695 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:19:12,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 02:19:12,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-24 02:19:12,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-24 02:19:14,234 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:19:14,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 02:19:14,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:19:14,749 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:19:14,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 02:19:14,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:19:15,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 02:19:15,259 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-11-24 02:19:15,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:19:15,782 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:19:15,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 02:19:15,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:19:16,338 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:19:16,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 02:19:16,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:19:17,008 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:19:17,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-24 02:19:17,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:19:17,596 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-24 02:19:17,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-24 02:19:17,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-24 02:19:18,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-24 02:19:18,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-24 02:19:19,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-24 02:19:19,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-24 02:19:20,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-24 02:19:20,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:19:26,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 02:19:26,696 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-11-24 02:19:26,884 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-11-24 02:19:26,964 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-11-24 02:19:27,103 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-11-24 02:19:27,242 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-11-24 02:19:27,402 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-11-24 02:19:27,625 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-11-24 02:19:27,952 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-11-24 02:19:28,184 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-11-24 02:19:28,644 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-11-24 02:19:28,892 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-11-24 02:19:41,107 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-11-24 02:19:45,566 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-11-24 02:19:45,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336705813] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:19:45,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 02:19:45,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19] total 24 [2024-11-24 02:19:45,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257034628] [2024-11-24 02:19:45,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 02:19:45,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-24 02:19:45,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:19:45,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-24 02:19:45,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=719, Unknown=29, NotChecked=780, Total=1640 [2024-11-24 02:19:45,582 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-11-24 02:20:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:20:22,943 INFO L93 Difference]: Finished difference Result 876 states and 1058 transitions. [2024-11-24 02:20:22,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-24 02:20:22,943 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-11-24 02:20:22,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:20:22,945 INFO L225 Difference]: With dead ends: 876 [2024-11-24 02:20:22,945 INFO L226 Difference]: Without dead ends: 874 [2024-11-24 02:20:22,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 34.8s TimeCoverageRelationStatistics Valid=291, Invalid=2170, Unknown=37, NotChecked=1284, Total=3782 [2024-11-24 02:20:22,946 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 887 mSDsluCounter, 4131 mSDsCounter, 0 mSdLazyCounter, 3558 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 4452 SdHoareTripleChecker+Invalid, 3574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.4s IncrementalHoareTripleChecker+Time [2024-11-24 02:20:22,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 4452 Invalid, 3574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3558 Invalid, 0 Unknown, 0 Unchecked, 28.4s Time] [2024-11-24 02:20:22,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-24 02:20:22,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-24 02:20:22,957 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-11-24 02:20:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1056 transitions. [2024-11-24 02:20:22,959 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1056 transitions. Word has length 126 [2024-11-24 02:20:22,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:20:22,960 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1056 transitions. [2024-11-24 02:20:22,960 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-11-24 02:20:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1056 transitions. [2024-11-24 02:20:22,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-24 02:20:22,961 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:20:22,961 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-11-24 02:20:22,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-24 02:20:23,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0b718cf-4c30-4696-b55c-a48d0b61512c/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:20:23,165 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-11-24 02:20:23,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:20:23,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1224414959, now seen corresponding path program 2 times [2024-11-24 02:20:23,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:20:23,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211620935] [2024-11-24 02:20:23,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 02:20:23,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:20:23,221 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-24 02:20:23,221 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 02:20:24,132 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-24 02:20:24,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:20:24,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211620935] [2024-11-24 02:20:24,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211620935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:20:24,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:20:24,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 02:20:24,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413911013] [2024-11-24 02:20:24,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:20:24,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 02:20:24,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:20:24,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 02:20:24,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 02:20:24,134 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-11-24 02:20:27,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:20:27,089 INFO L93 Difference]: Finished difference Result 894 states and 1080 transitions. [2024-11-24 02:20:27,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 02:20:27,089 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-11-24 02:20:27,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:20:27,091 INFO L225 Difference]: With dead ends: 894 [2024-11-24 02:20:27,091 INFO L226 Difference]: Without dead ends: 894 [2024-11-24 02:20:27,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-24 02:20:27,092 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 9 mSDsluCounter, 1743 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s 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, 2.8s IncrementalHoareTripleChecker+Time [2024-11-24 02:20:27,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2254 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-24 02:20:27,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-11-24 02:20:27,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 882. [2024-11-24 02:20:27,104 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-11-24 02:20:27,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1060 transitions. [2024-11-24 02:20:27,108 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1060 transitions. Word has length 128 [2024-11-24 02:20:27,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:20:27,109 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1060 transitions. [2024-11-24 02:20:27,109 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-11-24 02:20:27,109 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1060 transitions. [2024-11-24 02:20:27,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-24 02:20:27,110 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:20:27,110 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-11-24 02:20:27,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-24 02:20:27,110 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-11-24 02:20:27,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:20:27,111 INFO L85 PathProgramCache]: Analyzing trace with hash -276010185, now seen corresponding path program 1 times [2024-11-24 02:20:27,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:20:27,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353261095] [2024-11-24 02:20:27,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:20:27,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:20:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:20:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-24 02:20:27,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:20:27,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353261095] [2024-11-24 02:20:27,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353261095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:20:27,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:20:27,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-24 02:20:27,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617766209] [2024-11-24 02:20:27,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:20:27,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 02:20:27,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:20:27,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 02:20:27,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-24 02:20:27,811 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-11-24 02:20:31,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:20:31,021 INFO L93 Difference]: Finished difference Result 902 states and 1084 transitions. [2024-11-24 02:20:31,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 02:20:31,022 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-11-24 02:20:31,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:20:31,024 INFO L225 Difference]: With dead ends: 902 [2024-11-24 02:20:31,024 INFO L226 Difference]: Without dead ends: 902 [2024-11-24 02:20:31,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-24 02:20:31,025 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 10 mSDsluCounter, 2201 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s 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.2s IncrementalHoareTripleChecker+Time [2024-11-24 02:20:31,025 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.2s Time] [2024-11-24 02:20:31,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-11-24 02:20:31,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 898. [2024-11-24 02:20:31,032 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-11-24 02:20:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1080 transitions. [2024-11-24 02:20:31,033 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1080 transitions. Word has length 129 [2024-11-24 02:20:31,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:20:31,033 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1080 transitions. [2024-11-24 02:20:31,033 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-11-24 02:20:31,033 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1080 transitions. [2024-11-24 02:20:31,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-24 02:20:31,034 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:20:31,034 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-11-24 02:20:31,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-24 02:20:31,034 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-11-24 02:20:31,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:20:31,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1619411060, now seen corresponding path program 1 times [2024-11-24 02:20:31,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:20:31,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710215276] [2024-11-24 02:20:31,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:20:31,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:20:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:20:31,841 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-24 02:20:31,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:20:31,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710215276] [2024-11-24 02:20:31,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710215276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:20:31,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:20:31,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 02:20:31,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422397448] [2024-11-24 02:20:31,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:20:31,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 02:20:31,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:20:31,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 02:20:31,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 02:20:31,845 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)