./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6e4c99f3f2b3af55bcad347a1b5bde7c2cd0c2bc102d0028ba92b38579ab012d --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:01:27,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:01:27,301 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-28 03:01:27,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:01:27,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:01:27,350 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:01:27,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:01:27,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:01:27,351 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:01:27,351 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:01:27,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:01:27,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:01:27,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:01:27,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:01:27,352 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:01:27,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:01:27,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:01:27,352 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:01:27,352 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 03:01:27,352 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 03:01:27,353 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 03:01:27,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:01:27,354 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:01:27,354 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:01:27,354 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:01:27,354 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:01:27,354 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:01:27,354 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:01:27,354 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:01:27,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:01:27,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:01:27,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:01:27,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:01:27,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:01:27,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:01:27,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:01:27,355 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:01:27,355 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:01:27,355 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:01:27,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:01:27,356 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:01:27,356 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:01:27,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:01:27,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:01:27,356 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_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e4c99f3f2b3af55bcad347a1b5bde7c2cd0c2bc102d0028ba92b38579ab012d [2024-11-28 03:01:27,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:01:27,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:01:27,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:01:27,682 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:01:27,682 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:01:27,684 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-1.i [2024-11-28 03:01:30,650 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/data/21742219e/c2043e0f9c6549849fb2eea50d886761/FLAG9db7ab2b2 [2024-11-28 03:01:31,163 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:01:31,163 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-1.i [2024-11-28 03:01:31,195 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/data/21742219e/c2043e0f9c6549849fb2eea50d886761/FLAG9db7ab2b2 [2024-11-28 03:01:31,212 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/data/21742219e/c2043e0f9c6549849fb2eea50d886761 [2024-11-28 03:01:31,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:01:31,218 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:01:31,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:01:31,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:01:31,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:01:31,227 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:01:31" (1/1) ... [2024-11-28 03:01:31,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e5aaec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:31, skipping insertion in model container [2024-11-28 03:01:31,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:01:31" (1/1) ... [2024-11-28 03:01:31,317 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:01:32,213 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:01:32,218 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:01:32,220 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:01:32,222 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:01:32,223 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:01:32,223 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:01:32,225 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:01:32,225 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:01:32,227 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:01:32,230 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:01:32,232 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:01:32,246 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:01:32,247 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:01:32,251 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:01:32,256 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:01:32,260 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:01:32,273 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 03:01:32,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:01:32,310 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:01:32,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:01:32,662 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2024-11-28 03:01:32,672 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:01:32,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:32 WrapperNode [2024-11-28 03:01:32,672 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:01:32,673 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:01:32,673 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:01:32,673 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:01:32,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:32" (1/1) ... [2024-11-28 03:01:32,734 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:32" (1/1) ... [2024-11-28 03:01:32,819 INFO L138 Inliner]: procedures = 574, calls = 489, calls flagged for inlining = 16, calls inlined = 15, statements flattened = 786 [2024-11-28 03:01:32,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:01:32,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:01:32,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:01:32,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:01:32,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:32" (1/1) ... [2024-11-28 03:01:32,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:32" (1/1) ... [2024-11-28 03:01:32,849 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:32" (1/1) ... [2024-11-28 03:01:32,874 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-28 03:01:32,875 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:32" (1/1) ... [2024-11-28 03:01:32,876 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:32" (1/1) ... [2024-11-28 03:01:32,918 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:32" (1/1) ... [2024-11-28 03:01:32,920 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:32" (1/1) ... [2024-11-28 03:01:32,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:32" (1/1) ... [2024-11-28 03:01:32,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:32" (1/1) ... [2024-11-28 03:01:32,933 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:32" (1/1) ... [2024-11-28 03:01:32,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:01:32,942 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:01:32,942 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:01:32,942 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:01:32,943 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:32" (1/1) ... [2024-11-28 03:01:32,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:01:32,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:01:32,994 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:01:32,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:01:33,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 03:01:33,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2024-11-28 03:01:33,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-28 03:01:33,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-28 03:01:33,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:01:33,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:01:33,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-28 03:01:33,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:01:33,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:01:33,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2024-11-28 03:01:33,032 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2024-11-28 03:01:33,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2024-11-28 03:01:33,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2024-11-28 03:01:33,032 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-28 03:01:33,035 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-28 03:01:33,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 03:01:33,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-28 03:01:33,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-28 03:01:33,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-28 03:01:33,402 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:01:33,405 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:01:34,688 INFO L? ?]: Removed 365 outVars from TransFormulas that were not future-live. [2024-11-28 03:01:34,689 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:01:34,714 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:01:34,717 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-28 03:01:34,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:01:34 BoogieIcfgContainer [2024-11-28 03:01:34,718 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:01:34,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:01:34,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:01:34,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:01:34,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:01:31" (1/3) ... [2024-11-28 03:01:34,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568c5567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:01:34, skipping insertion in model container [2024-11-28 03:01:34,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:32" (2/3) ... [2024-11-28 03:01:34,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568c5567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:01:34, skipping insertion in model container [2024-11-28 03:01:34,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:01:34" (3/3) ... [2024-11-28 03:01:34,731 INFO L128 eAbstractionObserver]: Analyzing ICFG mkfifo-incomplete-1.i [2024-11-28 03:01:34,752 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:01:34,754 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mkfifo-incomplete-1.i that has 3 procedures, 316 locations, 1 initial locations, 12 loop locations, and 125 error locations. [2024-11-28 03:01:34,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:01:34,829 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;@303d8fe8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:01:34,832 INFO L334 AbstractCegarLoop]: Starting to check reachability of 125 error locations. [2024-11-28 03:01:34,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 316 states, 181 states have (on average 1.9171270718232045) internal successors, (347), 306 states have internal predecessors, (347), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-28 03:01:34,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 03:01:34,844 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:01:34,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 03:01:34,845 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-28 03:01:34,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:34,851 INFO L85 PathProgramCache]: Analyzing trace with hash 62626, now seen corresponding path program 1 times [2024-11-28 03:01:34,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:34,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904039316] [2024-11-28 03:01:34,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:34,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:35,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:01:35,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:35,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904039316] [2024-11-28 03:01:35,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904039316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:35,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:35,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:01:35,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810781] [2024-11-28 03:01:35,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:35,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:01:35,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:35,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:01:35,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:01:35,680 INFO L87 Difference]: Start difference. First operand has 316 states, 181 states have (on average 1.9171270718232045) internal successors, (347), 306 states have internal predecessors, (347), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:35,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:01:35,992 INFO L93 Difference]: Finished difference Result 222 states and 242 transitions. [2024-11-28 03:01:35,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:01:35,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 03:01:35,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:01:36,006 INFO L225 Difference]: With dead ends: 222 [2024-11-28 03:01:36,006 INFO L226 Difference]: Without dead ends: 220 [2024-11-28 03:01:36,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:01:36,015 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 122 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:01:36,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 176 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:01:36,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-28 03:01:36,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 152. [2024-11-28 03:01:36,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 90 states have (on average 1.7555555555555555) internal successors, (158), 147 states have internal predecessors, (158), 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-28 03:01:36,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2024-11-28 03:01:36,070 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 3 [2024-11-28 03:01:36,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:01:36,071 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2024-11-28 03:01:36,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:36,071 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2024-11-28 03:01:36,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 03:01:36,071 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:01:36,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 03:01:36,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:01:36,072 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-28 03:01:36,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:36,073 INFO L85 PathProgramCache]: Analyzing trace with hash 62627, now seen corresponding path program 1 times [2024-11-28 03:01:36,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:36,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628354067] [2024-11-28 03:01:36,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:36,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:36,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:01:36,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:36,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628354067] [2024-11-28 03:01:36,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628354067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:36,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:36,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:01:36,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719216686] [2024-11-28 03:01:36,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:36,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:01:36,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:36,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:01:36,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:01:36,473 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:36,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:01:36,628 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2024-11-28 03:01:36,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:01:36,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 03:01:36,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:01:36,630 INFO L225 Difference]: With dead ends: 151 [2024-11-28 03:01:36,630 INFO L226 Difference]: Without dead ends: 151 [2024-11-28 03:01:36,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:01:36,631 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 12 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:01:36,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 253 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:01:36,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-28 03:01:36,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-11-28 03:01:36,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 90 states have (on average 1.7444444444444445) internal successors, (157), 146 states have internal predecessors, (157), 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-28 03:01:36,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2024-11-28 03:01:36,641 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 3 [2024-11-28 03:01:36,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:01:36,641 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2024-11-28 03:01:36,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:36,642 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2024-11-28 03:01:36,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-28 03:01:36,642 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:01:36,642 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:36,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:01:36,642 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-28 03:01:36,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:36,643 INFO L85 PathProgramCache]: Analyzing trace with hash 2002134442, now seen corresponding path program 1 times [2024-11-28 03:01:36,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:36,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807673774] [2024-11-28 03:01:36,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:36,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:01:37,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:37,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807673774] [2024-11-28 03:01:37,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807673774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:37,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:37,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:01:37,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879355068] [2024-11-28 03:01:37,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:37,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:01:37,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:37,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:01:37,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:01:37,018 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:37,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:01:37,195 INFO L93 Difference]: Finished difference Result 155 states and 167 transitions. [2024-11-28 03:01:37,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:01:37,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2024-11-28 03:01:37,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:01:37,196 INFO L225 Difference]: With dead ends: 155 [2024-11-28 03:01:37,196 INFO L226 Difference]: Without dead ends: 155 [2024-11-28 03:01:37,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:01:37,199 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 13 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:01:37,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 254 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:01:37,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-28 03:01:37,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2024-11-28 03:01:37,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 93 states have (on average 1.7204301075268817) internal successors, (160), 149 states have internal predecessors, (160), 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-28 03:01:37,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2024-11-28 03:01:37,212 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 7 [2024-11-28 03:01:37,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:01:37,212 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2024-11-28 03:01:37,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:37,212 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2024-11-28 03:01:37,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 03:01:37,213 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:01:37,213 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:37,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:01:37,213 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-28 03:01:37,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:37,214 INFO L85 PathProgramCache]: Analyzing trace with hash -283912093, now seen corresponding path program 1 times [2024-11-28 03:01:37,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:37,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066320113] [2024-11-28 03:01:37,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:37,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:37,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:01:37,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:37,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066320113] [2024-11-28 03:01:37,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066320113] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:01:37,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267022118] [2024-11-28 03:01:37,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:37,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:01:37,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:01:37,780 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:01:37,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:01:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:38,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-28 03:01:38,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:01:38,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:01:38,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:01:38,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-28 03:01:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:01:38,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267022118] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:01:38,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:01:38,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-28 03:01:38,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185178198] [2024-11-28 03:01:38,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:01:38,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 03:01:38,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:38,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 03:01:38,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:01:38,430 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:38,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:01:38,825 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2024-11-28 03:01:38,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:01:38,826 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 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 11 [2024-11-28 03:01:38,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:01:38,826 INFO L225 Difference]: With dead ends: 159 [2024-11-28 03:01:38,827 INFO L226 Difference]: Without dead ends: 159 [2024-11-28 03:01:38,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2024-11-28 03:01:38,828 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 289 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:01:38,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 548 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:01:38,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-28 03:01:38,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-11-28 03:01:38,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 99 states have (on average 1.6666666666666667) internal successors, (165), 154 states have internal predecessors, (165), 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-28 03:01:38,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 171 transitions. [2024-11-28 03:01:38,846 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 171 transitions. Word has length 11 [2024-11-28 03:01:38,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:01:38,847 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 171 transitions. [2024-11-28 03:01:38,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:38,847 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 171 transitions. [2024-11-28 03:01:38,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-28 03:01:38,847 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:01:38,847 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:38,860 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 03:01:39,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:01:39,048 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-28 03:01:39,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:39,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1010268374, now seen corresponding path program 1 times [2024-11-28 03:01:39,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:39,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371464864] [2024-11-28 03:01:39,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:39,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:39,378 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:01:39,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:39,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371464864] [2024-11-28 03:01:39,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371464864] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:01:39,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008418058] [2024-11-28 03:01:39,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:39,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:01:39,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:01:39,381 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:01:39,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:01:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:39,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 03:01:39,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:01:39,738 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:01:39,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:01:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:01:39,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008418058] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:01:39,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:01:39,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-28 03:01:39,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385873985] [2024-11-28 03:01:39,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:01:39,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 03:01:39,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:39,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:01:39,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:01:39,826 INFO L87 Difference]: Start difference. First operand 159 states and 171 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:39,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:01:39,900 INFO L93 Difference]: Finished difference Result 179 states and 191 transitions. [2024-11-28 03:01:39,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:01:39,901 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 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 19 [2024-11-28 03:01:39,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:01:39,902 INFO L225 Difference]: With dead ends: 179 [2024-11-28 03:01:39,902 INFO L226 Difference]: Without dead ends: 179 [2024-11-28 03:01:39,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:01:39,904 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 6 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:01:39,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 782 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:01:39,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-28 03:01:39,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-28 03:01:39,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 119 states have (on average 1.5546218487394958) internal successors, (185), 174 states have internal predecessors, (185), 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-28 03:01:39,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 191 transitions. [2024-11-28 03:01:39,924 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 191 transitions. Word has length 19 [2024-11-28 03:01:39,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:01:39,925 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 191 transitions. [2024-11-28 03:01:39,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:39,925 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 191 transitions. [2024-11-28 03:01:39,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-28 03:01:39,926 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:01:39,926 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:39,937 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 03:01:40,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:01:40,126 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-28 03:01:40,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:40,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1745438195, now seen corresponding path program 2 times [2024-11-28 03:01:40,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:40,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049040481] [2024-11-28 03:01:40,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:01:40,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:40,196 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:01:40,196 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:01:40,517 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-28 03:01:40,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:40,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049040481] [2024-11-28 03:01:40,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049040481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:40,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:40,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:01:40,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319746001] [2024-11-28 03:01:40,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:40,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:01:40,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:40,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:01:40,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:01:40,519 INFO L87 Difference]: Start difference. First operand 179 states and 191 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:40,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:01:40,716 INFO L93 Difference]: Finished difference Result 250 states and 269 transitions. [2024-11-28 03:01:40,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:01:40,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 39 [2024-11-28 03:01:40,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:01:40,718 INFO L225 Difference]: With dead ends: 250 [2024-11-28 03:01:40,718 INFO L226 Difference]: Without dead ends: 250 [2024-11-28 03:01:40,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:01:40,719 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 122 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:01:40,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 238 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:01:40,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-28 03:01:40,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 198. [2024-11-28 03:01:40,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 137 states have (on average 1.5693430656934306) internal successors, (215), 191 states have internal predecessors, (215), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:01:40,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 223 transitions. [2024-11-28 03:01:40,728 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 223 transitions. Word has length 39 [2024-11-28 03:01:40,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:01:40,728 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 223 transitions. [2024-11-28 03:01:40,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:40,729 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 223 transitions. [2024-11-28 03:01:40,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-28 03:01:40,729 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:01:40,729 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:40,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:01:40,730 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-28 03:01:40,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:40,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1745438196, now seen corresponding path program 1 times [2024-11-28 03:01:40,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:40,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452060909] [2024-11-28 03:01:40,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:40,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:41,240 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:01:41,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:41,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452060909] [2024-11-28 03:01:41,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452060909] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:01:41,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473247280] [2024-11-28 03:01:41,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:41,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:01:41,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:01:41,244 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:01:41,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:01:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:41,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-28 03:01:41,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:01:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:01:41,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:01:41,855 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:01:41,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473247280] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:01:41,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:01:41,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2024-11-28 03:01:41,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896509005] [2024-11-28 03:01:41,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:01:41,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 03:01:41,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:41,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 03:01:41,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:01:41,858 INFO L87 Difference]: Start difference. First operand 198 states and 223 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:41,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:01:41,942 INFO L93 Difference]: Finished difference Result 206 states and 231 transitions. [2024-11-28 03:01:41,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:01:41,943 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 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 39 [2024-11-28 03:01:41,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:01:41,944 INFO L225 Difference]: With dead ends: 206 [2024-11-28 03:01:41,944 INFO L226 Difference]: Without dead ends: 206 [2024-11-28 03:01:41,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:01:41,945 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 3 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:01:41,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 627 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:01:41,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-28 03:01:41,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2024-11-28 03:01:41,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 145 states have (on average 1.5379310344827586) internal successors, (223), 199 states have internal predecessors, (223), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:01:41,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 231 transitions. [2024-11-28 03:01:41,960 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 231 transitions. Word has length 39 [2024-11-28 03:01:41,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:01:41,961 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 231 transitions. [2024-11-28 03:01:41,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:41,963 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 231 transitions. [2024-11-28 03:01:41,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 03:01:41,964 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:01:41,964 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:41,980 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 03:01:42,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:01:42,168 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-28 03:01:42,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:42,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1610981658, now seen corresponding path program 2 times [2024-11-28 03:01:42,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:42,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472342091] [2024-11-28 03:01:42,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:01:42,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:42,242 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:01:42,243 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:01:42,555 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:01:42,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:42,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472342091] [2024-11-28 03:01:42,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472342091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:42,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:42,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:01:42,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762376814] [2024-11-28 03:01:42,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:42,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:01:42,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:42,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:01:42,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:01:42,559 INFO L87 Difference]: Start difference. First operand 206 states and 231 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:42,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:01:42,919 INFO L93 Difference]: Finished difference Result 332 states and 354 transitions. [2024-11-28 03:01:42,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:01:42,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-28 03:01:42,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:01:42,922 INFO L225 Difference]: With dead ends: 332 [2024-11-28 03:01:42,922 INFO L226 Difference]: Without dead ends: 332 [2024-11-28 03:01:42,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:01:42,923 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 319 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:01:42,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 272 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:01:42,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-28 03:01:42,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 205. [2024-11-28 03:01:42,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 198 states have internal predecessors, (222), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:01:42,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 230 transitions. [2024-11-28 03:01:42,934 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 230 transitions. Word has length 47 [2024-11-28 03:01:42,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:01:42,934 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 230 transitions. [2024-11-28 03:01:42,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:01:42,935 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 230 transitions. [2024-11-28 03:01:42,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 03:01:42,939 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:01:42,939 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:42,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:01:42,939 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-28 03:01:42,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:42,940 INFO L85 PathProgramCache]: Analyzing trace with hash -484733968, now seen corresponding path program 1 times [2024-11-28 03:01:42,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:42,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864183322] [2024-11-28 03:01:42,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:42,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:43,350 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:01:43,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:43,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864183322] [2024-11-28 03:01:43,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864183322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:43,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:43,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:01:43,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474063183] [2024-11-28 03:01:43,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:43,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:01:43,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:43,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:01:43,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:01:43,353 INFO L87 Difference]: Start difference. First operand 205 states and 230 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:01:43,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:01:43,528 INFO L93 Difference]: Finished difference Result 252 states and 271 transitions. [2024-11-28 03:01:43,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:01:43,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 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 55 [2024-11-28 03:01:43,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:01:43,530 INFO L225 Difference]: With dead ends: 252 [2024-11-28 03:01:43,530 INFO L226 Difference]: Without dead ends: 252 [2024-11-28 03:01:43,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:01:43,531 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 100 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:01:43,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 180 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:01:43,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-28 03:01:43,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 200. [2024-11-28 03:01:43,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 145 states have (on average 1.4965517241379311) internal successors, (217), 193 states have internal predecessors, (217), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:01:43,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 225 transitions. [2024-11-28 03:01:43,538 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 225 transitions. Word has length 55 [2024-11-28 03:01:43,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:01:43,538 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 225 transitions. [2024-11-28 03:01:43,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:01:43,539 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 225 transitions. [2024-11-28 03:01:43,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 03:01:43,539 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:01:43,539 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:43,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:01:43,542 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-28 03:01:43,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:43,543 INFO L85 PathProgramCache]: Analyzing trace with hash -484733967, now seen corresponding path program 1 times [2024-11-28 03:01:43,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:43,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975307076] [2024-11-28 03:01:43,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:43,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:44,600 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:01:44,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:44,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975307076] [2024-11-28 03:01:44,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975307076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:44,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:44,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:01:44,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748478246] [2024-11-28 03:01:44,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:44,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:01:44,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:44,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:01:44,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:01:44,604 INFO L87 Difference]: Start difference. First operand 200 states and 225 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:01:44,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:01:44,862 INFO L93 Difference]: Finished difference Result 250 states and 283 transitions. [2024-11-28 03:01:44,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:01:44,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 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 55 [2024-11-28 03:01:44,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:01:44,865 INFO L225 Difference]: With dead ends: 250 [2024-11-28 03:01:44,867 INFO L226 Difference]: Without dead ends: 250 [2024-11-28 03:01:44,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:01:44,868 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 169 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:01:44,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 615 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:01:44,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-28 03:01:44,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 199. [2024-11-28 03:01:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 145 states have (on average 1.4896551724137932) internal successors, (216), 192 states have internal predecessors, (216), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:01:44,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 224 transitions. [2024-11-28 03:01:44,879 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 224 transitions. Word has length 55 [2024-11-28 03:01:44,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:01:44,882 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 224 transitions. [2024-11-28 03:01:44,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:01:44,883 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 224 transitions. [2024-11-28 03:01:44,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-28 03:01:44,883 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:01:44,883 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:44,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:01:44,883 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-28 03:01:44,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:44,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1851421448, now seen corresponding path program 1 times [2024-11-28 03:01:44,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:44,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967730346] [2024-11-28 03:01:44,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:44,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:45,521 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:01:45,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:45,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967730346] [2024-11-28 03:01:45,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967730346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:45,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:45,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:01:45,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6414327] [2024-11-28 03:01:45,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:45,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:01:45,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:45,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:01:45,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:01:45,525 INFO L87 Difference]: Start difference. First operand 199 states and 224 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:01:45,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:01:45,944 INFO L93 Difference]: Finished difference Result 271 states and 293 transitions. [2024-11-28 03:01:45,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:01:45,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 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 59 [2024-11-28 03:01:45,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:01:45,946 INFO L225 Difference]: With dead ends: 271 [2024-11-28 03:01:45,947 INFO L226 Difference]: Without dead ends: 271 [2024-11-28 03:01:45,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:01:45,948 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 224 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:01:45,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 297 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:01:45,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-28 03:01:45,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 213. [2024-11-28 03:01:45,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 160 states have (on average 1.4875) internal successors, (238), 206 states have internal predecessors, (238), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:01:45,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 246 transitions. [2024-11-28 03:01:45,963 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 246 transitions. Word has length 59 [2024-11-28 03:01:45,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:01:45,964 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 246 transitions. [2024-11-28 03:01:45,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:01:45,964 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 246 transitions. [2024-11-28 03:01:45,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-28 03:01:45,967 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:01:45,967 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:45,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:01:45,967 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-28 03:01:45,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:45,967 INFO L85 PathProgramCache]: Analyzing trace with hash 273678751, now seen corresponding path program 1 times [2024-11-28 03:01:45,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:45,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240847798] [2024-11-28 03:01:45,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:45,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:46,356 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:01:46,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:46,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240847798] [2024-11-28 03:01:46,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240847798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:46,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:46,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:01:46,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005777195] [2024-11-28 03:01:46,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:46,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:01:46,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:46,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:01:46,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:01:46,358 INFO L87 Difference]: Start difference. First operand 213 states and 246 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:01:46,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:01:46,525 INFO L93 Difference]: Finished difference Result 254 states and 282 transitions. [2024-11-28 03:01:46,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:01:46,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 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 62 [2024-11-28 03:01:46,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:01:46,527 INFO L225 Difference]: With dead ends: 254 [2024-11-28 03:01:46,527 INFO L226 Difference]: Without dead ends: 254 [2024-11-28 03:01:46,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:01:46,528 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 92 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:01:46,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 176 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:01:46,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-28 03:01:46,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 220. [2024-11-28 03:01:46,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 168 states have (on average 1.4761904761904763) internal successors, (248), 213 states have internal predecessors, (248), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:01:46,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 256 transitions. [2024-11-28 03:01:46,535 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 256 transitions. Word has length 62 [2024-11-28 03:01:46,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:01:46,535 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 256 transitions. [2024-11-28 03:01:46,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:01:46,536 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 256 transitions. [2024-11-28 03:01:46,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-28 03:01:46,536 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:01:46,537 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:46,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:01:46,537 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-28 03:01:46,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:46,537 INFO L85 PathProgramCache]: Analyzing trace with hash 273678752, now seen corresponding path program 1 times [2024-11-28 03:01:46,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:46,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103835053] [2024-11-28 03:01:46,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:46,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:01:47,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:47,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103835053] [2024-11-28 03:01:47,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103835053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:47,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:47,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:01:47,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411369054] [2024-11-28 03:01:47,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:47,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:01:47,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:47,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:01:47,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:01:47,706 INFO L87 Difference]: Start difference. First operand 220 states and 256 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:01:48,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:01:48,293 INFO L93 Difference]: Finished difference Result 272 states and 311 transitions. [2024-11-28 03:01:48,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:01:48,294 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (1), 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 62 [2024-11-28 03:01:48,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:01:48,295 INFO L225 Difference]: With dead ends: 272 [2024-11-28 03:01:48,295 INFO L226 Difference]: Without dead ends: 272 [2024-11-28 03:01:48,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:01:48,296 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 132 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:01:48,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 479 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 03:01:48,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-28 03:01:48,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 220. [2024-11-28 03:01:48,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 168 states have (on average 1.4702380952380953) internal successors, (247), 213 states have internal predecessors, (247), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:01:48,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 255 transitions. [2024-11-28 03:01:48,304 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 255 transitions. Word has length 62 [2024-11-28 03:01:48,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:01:48,305 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 255 transitions. [2024-11-28 03:01:48,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:01:48,305 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 255 transitions. [2024-11-28 03:01:48,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-28 03:01:48,305 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:01:48,306 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:48,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 03:01:48,306 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-28 03:01:48,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:48,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1789920404, now seen corresponding path program 1 times [2024-11-28 03:01:48,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:48,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547835638] [2024-11-28 03:01:48,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:48,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-28 03:01:48,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:48,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547835638] [2024-11-28 03:01:48,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547835638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:48,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:48,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:01:48,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732027037] [2024-11-28 03:01:48,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:48,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:01:48,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:48,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:01:48,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:01:48,593 INFO L87 Difference]: Start difference. First operand 220 states and 255 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:01:48,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:01:48,826 INFO L93 Difference]: Finished difference Result 258 states and 284 transitions. [2024-11-28 03:01:48,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:01:48,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 65 [2024-11-28 03:01:48,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:01:48,828 INFO L225 Difference]: With dead ends: 258 [2024-11-28 03:01:48,828 INFO L226 Difference]: Without dead ends: 258 [2024-11-28 03:01:48,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:01:48,828 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 179 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:01:48,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 223 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:01:48,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-28 03:01:48,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 219. [2024-11-28 03:01:48,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 170 states have (on average 1.4411764705882353) internal successors, (245), 212 states have internal predecessors, (245), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:01:48,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 253 transitions. [2024-11-28 03:01:48,843 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 253 transitions. Word has length 65 [2024-11-28 03:01:48,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:01:48,843 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 253 transitions. [2024-11-28 03:01:48,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:01:48,844 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 253 transitions. [2024-11-28 03:01:48,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-28 03:01:48,845 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:01:48,845 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:48,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 03:01:48,845 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-28 03:01:48,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:48,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1789920403, now seen corresponding path program 1 times [2024-11-28 03:01:48,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:48,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066633790] [2024-11-28 03:01:48,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:48,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:49,234 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2024-11-28 03:01:49,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:49,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066633790] [2024-11-28 03:01:49,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066633790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:01:49,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904485317] [2024-11-28 03:01:49,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:49,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:01:49,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:01:49,237 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:01:49,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:01:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:49,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 03:01:49,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:01:49,709 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2024-11-28 03:01:49,709 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:01:49,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904485317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:49,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:01:49,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 9 [2024-11-28 03:01:49,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501020502] [2024-11-28 03:01:49,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:49,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:01:49,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:49,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:01:49,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:01:49,711 INFO L87 Difference]: Start difference. First operand 219 states and 253 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:01:49,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:01:49,829 INFO L93 Difference]: Finished difference Result 226 states and 256 transitions. [2024-11-28 03:01:49,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:01:49,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 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 65 [2024-11-28 03:01:49,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:01:49,830 INFO L225 Difference]: With dead ends: 226 [2024-11-28 03:01:49,831 INFO L226 Difference]: Without dead ends: 224 [2024-11-28 03:01:49,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:01:49,833 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 21 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:01:49,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 793 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:01:49,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-28 03:01:49,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 219. [2024-11-28 03:01:49,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 170 states have (on average 1.4352941176470588) internal successors, (244), 212 states have internal predecessors, (244), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:01:49,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 252 transitions. [2024-11-28 03:01:49,842 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 252 transitions. Word has length 65 [2024-11-28 03:01:49,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:01:49,843 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 252 transitions. [2024-11-28 03:01:49,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:01:49,843 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 252 transitions. [2024-11-28 03:01:49,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-28 03:01:49,848 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:01:49,848 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:49,860 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 03:01:50,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-28 03:01:50,052 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-28 03:01:50,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:50,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1315800862, now seen corresponding path program 1 times [2024-11-28 03:01:50,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:50,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443752790] [2024-11-28 03:01:50,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:50,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:50,641 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:01:50,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:50,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443752790] [2024-11-28 03:01:50,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443752790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:50,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:50,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:01:50,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477245224] [2024-11-28 03:01:50,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:50,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:01:50,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:50,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:01:50,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:01:50,643 INFO L87 Difference]: Start difference. First operand 219 states and 252 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:01:50,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:01:50,957 INFO L93 Difference]: Finished difference Result 218 states and 250 transitions. [2024-11-28 03:01:50,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:01:50,958 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 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 65 [2024-11-28 03:01:50,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:01:50,959 INFO L225 Difference]: With dead ends: 218 [2024-11-28 03:01:50,960 INFO L226 Difference]: Without dead ends: 218 [2024-11-28 03:01:50,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:01:50,960 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 100 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:01:50,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 440 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:01:50,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-28 03:01:50,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-11-28 03:01:50,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 170 states have (on average 1.423529411764706) internal successors, (242), 211 states have internal predecessors, (242), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:01:50,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 250 transitions. [2024-11-28 03:01:50,971 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 250 transitions. Word has length 65 [2024-11-28 03:01:50,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:01:50,972 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 250 transitions. [2024-11-28 03:01:50,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:01:50,972 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 250 transitions. [2024-11-28 03:01:50,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-28 03:01:50,973 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:01:50,973 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:50,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 03:01:50,973 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-28 03:01:50,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:50,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1315800863, now seen corresponding path program 1 times [2024-11-28 03:01:50,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:50,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772779546] [2024-11-28 03:01:50,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:50,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:51,833 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:01:51,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:51,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772779546] [2024-11-28 03:01:51,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772779546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:51,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:51,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:01:51,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607498416] [2024-11-28 03:01:51,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:51,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:01:51,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:51,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:01:51,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:01:51,837 INFO L87 Difference]: Start difference. First operand 218 states and 250 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:01:52,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:01:52,157 INFO L93 Difference]: Finished difference Result 217 states and 248 transitions. [2024-11-28 03:01:52,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:01:52,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 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 65 [2024-11-28 03:01:52,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:01:52,159 INFO L225 Difference]: With dead ends: 217 [2024-11-28 03:01:52,159 INFO L226 Difference]: Without dead ends: 217 [2024-11-28 03:01:52,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:01:52,159 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 98 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:01:52,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 478 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:01:52,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-28 03:01:52,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-11-28 03:01:52,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 170 states have (on average 1.411764705882353) internal successors, (240), 210 states have internal predecessors, (240), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:01:52,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 248 transitions. [2024-11-28 03:01:52,167 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 248 transitions. Word has length 65 [2024-11-28 03:01:52,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:01:52,168 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 248 transitions. [2024-11-28 03:01:52,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:01:52,168 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 248 transitions. [2024-11-28 03:01:52,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 03:01:52,169 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:01:52,169 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:52,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 03:01:52,169 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-28 03:01:52,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:52,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1121295624, now seen corresponding path program 1 times [2024-11-28 03:01:52,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:52,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464516263] [2024-11-28 03:01:52,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:52,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:53,111 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:01:53,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:53,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464516263] [2024-11-28 03:01:53,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464516263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:53,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:53,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:01:53,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192964302] [2024-11-28 03:01:53,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:53,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:01:53,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:53,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:01:53,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:01:53,113 INFO L87 Difference]: Start difference. First operand 217 states and 248 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:01:53,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:01:53,551 INFO L93 Difference]: Finished difference Result 226 states and 256 transitions. [2024-11-28 03:01:53,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:01:53,551 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 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 70 [2024-11-28 03:01:53,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:01:53,553 INFO L225 Difference]: With dead ends: 226 [2024-11-28 03:01:53,553 INFO L226 Difference]: Without dead ends: 226 [2024-11-28 03:01:53,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:01:53,554 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 124 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:01:53,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 741 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:01:53,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-28 03:01:53,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 221. [2024-11-28 03:01:53,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 174 states have (on average 1.4137931034482758) internal successors, (246), 214 states have internal predecessors, (246), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:01:53,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 254 transitions. [2024-11-28 03:01:53,561 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 254 transitions. Word has length 70 [2024-11-28 03:01:53,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:01:53,562 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 254 transitions. [2024-11-28 03:01:53,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:01:53,562 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 254 transitions. [2024-11-28 03:01:53,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 03:01:53,563 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:01:53,563 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:01:53,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 03:01:53,563 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-28 03:01:53,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:53,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1121295625, now seen corresponding path program 1 times [2024-11-28 03:01:53,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:53,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271253933] [2024-11-28 03:01:53,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:53,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:54,813 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:01:54,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:54,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271253933] [2024-11-28 03:01:54,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271253933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:01:54,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:01:54,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:01:54,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678049519] [2024-11-28 03:01:54,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:01:54,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 03:01:54,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:01:54,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:01:54,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:01:54,815 INFO L87 Difference]: Start difference. First operand 221 states and 254 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:01:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:01:55,526 INFO L93 Difference]: Finished difference Result 263 states and 289 transitions. [2024-11-28 03:01:55,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:01:55,527 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (1), 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 70 [2024-11-28 03:01:55,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:01:55,529 INFO L225 Difference]: With dead ends: 263 [2024-11-28 03:01:55,529 INFO L226 Difference]: Without dead ends: 263 [2024-11-28 03:01:55,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-28 03:01:55,531 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 270 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:01:55,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 604 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 03:01:55,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-28 03:01:55,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 225. [2024-11-28 03:01:55,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 178 states have (on average 1.404494382022472) internal successors, (250), 218 states have internal predecessors, (250), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:01:55,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 258 transitions. [2024-11-28 03:01:55,541 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 258 transitions. Word has length 70 [2024-11-28 03:01:55,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:01:55,541 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 258 transitions. [2024-11-28 03:01:55,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:01:55,541 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 258 transitions. [2024-11-28 03:01:55,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 03:01:55,542 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:01:55,542 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 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] [2024-11-28 03:01:55,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 03:01:55,542 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-28 03:01:55,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:01:55,545 INFO L85 PathProgramCache]: Analyzing trace with hash 896547055, now seen corresponding path program 1 times [2024-11-28 03:01:55,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:01:55,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543182367] [2024-11-28 03:01:55,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:55,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:01:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:56,573 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:01:56,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:01:56,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543182367] [2024-11-28 03:01:56,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543182367] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:01:56,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758138944] [2024-11-28 03:01:56,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:01:56,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:01:56,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:01:56,576 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:01:56,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 03:01:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:01:56,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 1232 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-28 03:01:56,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:01:57,006 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 10 treesize of output 8 [2024-11-28 03:01:57,059 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:01:57,059 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 17 treesize of output 21 [2024-11-28 03:01:57,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-28 03:01:57,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2024-11-28 03:01:57,296 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:01:57,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2024-11-28 03:01:57,407 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:01:57,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2024-11-28 03:01:57,444 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 37 treesize of output 13 [2024-11-28 03:01:57,523 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-28 03:01:57,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:01:57,615 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1636 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_1636) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) 1)) is different from false [2024-11-28 03:01:57,636 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1635 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_1635))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1636)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 03:01:57,646 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1635 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1635))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1636)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 03:02:01,796 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:01,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 71 [2024-11-28 03:02:01,807 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 6744 treesize of output 5392 [2024-11-28 03:02:01,884 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 587 treesize of output 467 [2024-11-28 03:02:01,898 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 467 treesize of output 419 [2024-11-28 03:02:01,909 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 419 treesize of output 335 [2024-11-28 03:02:04,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:04,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 178 treesize of output 876 [2024-11-28 03:02:25,120 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 190 trivial. 2 not checked. [2024-11-28 03:02:25,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758138944] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:02:25,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:02:25,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 23 [2024-11-28 03:02:25,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486318649] [2024-11-28 03:02:25,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:02:25,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 03:02:25,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:02:25,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 03:02:25,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=319, Unknown=28, NotChecked=120, Total=552 [2024-11-28 03:02:25,123 INFO L87 Difference]: Start difference. First operand 225 states and 258 transitions. Second operand has 24 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 24 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:02:26,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:02:26,216 INFO L93 Difference]: Finished difference Result 261 states and 286 transitions. [2024-11-28 03:02:26,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:02:26,216 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 24 states have internal predecessors, (70), 1 states have call successors, (1), 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 75 [2024-11-28 03:02:26,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:02:26,218 INFO L225 Difference]: With dead ends: 261 [2024-11-28 03:02:26,218 INFO L226 Difference]: Without dead ends: 261 [2024-11-28 03:02:26,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 137 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=114, Invalid=374, Unknown=30, NotChecked=132, Total=650 [2024-11-28 03:02:26,219 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 299 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 594 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:02:26,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 863 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 639 Invalid, 0 Unknown, 594 Unchecked, 0.9s Time] [2024-11-28 03:02:26,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-28 03:02:26,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 224. [2024-11-28 03:02:26,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 178 states have (on average 1.3876404494382022) internal successors, (247), 217 states have internal predecessors, (247), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:02:26,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 255 transitions. [2024-11-28 03:02:26,227 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 255 transitions. Word has length 75 [2024-11-28 03:02:26,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:02:26,227 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 255 transitions. [2024-11-28 03:02:26,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 24 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:02:26,227 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 255 transitions. [2024-11-28 03:02:26,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 03:02:26,228 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:02:26,228 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 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] [2024-11-28 03:02:26,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 03:02:26,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:02:26,433 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-28 03:02:26,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:02:26,433 INFO L85 PathProgramCache]: Analyzing trace with hash 896547056, now seen corresponding path program 1 times [2024-11-28 03:02:26,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:02:26,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009097606] [2024-11-28 03:02:26,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:02:26,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:02:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:02:27,891 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:02:27,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:02:27,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009097606] [2024-11-28 03:02:27,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009097606] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:02:27,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348417476] [2024-11-28 03:02:27,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:02:27,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:02:27,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:02:27,895 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:02:27,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 03:02:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:02:28,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 1232 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-28 03:02:28,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:02:28,322 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 10 treesize of output 8 [2024-11-28 03:02:28,357 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:02:28,358 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-28 03:02:28,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 03:02:28,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-28 03:02:28,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-28 03:02:28,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2024-11-28 03:02:28,494 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 20 treesize of output 15 [2024-11-28 03:02:28,587 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:02:28,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-28 03:02:28,600 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 36 treesize of output 15 [2024-11-28 03:02:28,731 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:02:28,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-28 03:02:28,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 36 treesize of output 15 [2024-11-28 03:02:28,795 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 37 treesize of output 13 [2024-11-28 03:02:28,798 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 11 treesize of output 3 [2024-11-28 03:02:28,823 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:02:28,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:02:28,926 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1866 (Array Int Int)) (v_ArrVal_1865 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_1866) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_1865) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_1866 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_1866) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1))))) is different from false [2024-11-28 03:02:29,084 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1866 (Array Int Int)) (v_ArrVal_1865 (Array Int Int))) (<= (+ 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1866) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1865) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_1866 (Array Int Int))) (<= 0 (+ 1 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1866) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2024-11-28 03:02:29,101 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1866 (Array Int Int)) (v_ArrVal_1864 (Array Int Int)) (v_ArrVal_1863 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_1863) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_1864) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_1866) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1))) (forall ((v_ArrVal_1866 (Array Int Int)) (v_ArrVal_1865 (Array Int Int)) (v_ArrVal_1864 (Array Int Int)) (v_ArrVal_1863 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_1864))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_1863) .cse1 v_ArrVal_1866) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 2) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1865) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))))) is different from false [2024-11-28 03:02:29,119 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1866 (Array Int Int)) (v_ArrVal_1864 (Array Int Int)) (v_ArrVal_1863 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1863) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1864) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1866) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_1866 (Array Int Int)) (v_ArrVal_1865 (Array Int Int)) (v_ArrVal_1864 (Array Int Int)) (v_ArrVal_1863 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1864))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ 2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1863) .cse2 v_ArrVal_1866) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1865) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))))) is different from false [2024-11-28 03:02:29,159 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1866 (Array Int Int)) (v_ArrVal_1864 (Array Int Int)) (v_ArrVal_1863 (Array Int Int)) (v_ArrVal_1862 (Array Int Int)) (v_ArrVal_1861 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1862))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1861) .cse0 v_ArrVal_1863) (select (select (store .cse1 .cse0 v_ArrVal_1864) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1866))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1))) (forall ((v_ArrVal_1866 (Array Int Int)) (v_ArrVal_1865 (Array Int Int)) (v_ArrVal_1864 (Array Int Int)) (v_ArrVal_1863 (Array Int Int)) (v_ArrVal_1862 (Array Int Int)) (v_ArrVal_1861 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1862))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1864))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ 2 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1861) .cse3 v_ArrVal_1863) .cse4 v_ArrVal_1866) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1865) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))) is different from false [2024-11-28 03:02:29,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:29,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 209 treesize of output 210 [2024-11-28 03:02:29,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:29,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 126 [2024-11-28 03:02:29,217 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 68010 treesize of output 57618 [2024-11-28 03:02:29,845 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 117384 treesize of output 113280 [2024-11-28 03:02:30,195 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 7660 treesize of output 7084 [2024-11-28 03:02:30,256 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 7084 treesize of output 6700 [2024-11-28 03:02:30,315 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 6700 treesize of output 5518 [2024-11-28 03:02:30,401 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 5518 treesize of output 5134 [2024-11-28 03:02:30,455 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 5134 treesize of output 4270 [2024-11-28 03:02:30,509 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 4270 treesize of output 4078 [2024-11-28 03:02:35,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:35,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 107 [2024-11-28 03:02:35,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:35,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 71 [2024-11-28 03:02:35,067 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:02:35,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 101 treesize of output 61 [2024-11-28 03:02:35,074 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:02:35,075 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:02:35,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 26 treesize of output 10 [2024-11-28 03:02:35,214 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:02:35,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-28 03:02:35,223 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 190 trivial. 2 not checked. [2024-11-28 03:02:35,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348417476] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:02:35,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:02:35,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 31 [2024-11-28 03:02:35,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432014176] [2024-11-28 03:02:35,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:02:35,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-28 03:02:35,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:02:35,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-28 03:02:35,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=599, Unknown=14, NotChecked=270, Total=992 [2024-11-28 03:02:35,226 INFO L87 Difference]: Start difference. First operand 224 states and 255 transitions. Second operand has 32 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 32 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:02:36,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:02:36,860 INFO L93 Difference]: Finished difference Result 281 states and 310 transitions. [2024-11-28 03:02:36,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:02:36,861 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 32 states have internal predecessors, (76), 1 states have call successors, (1), 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 75 [2024-11-28 03:02:36,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:02:36,862 INFO L225 Difference]: With dead ends: 281 [2024-11-28 03:02:36,862 INFO L226 Difference]: Without dead ends: 281 [2024-11-28 03:02:36,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=238, Invalid=1100, Unknown=14, NotChecked=370, Total=1722 [2024-11-28 03:02:36,865 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 409 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 22 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 1915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 1054 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:02:36,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 966 Invalid, 1915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 817 Invalid, 22 Unknown, 1054 Unchecked, 1.0s Time] [2024-11-28 03:02:36,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-28 03:02:36,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 244. [2024-11-28 03:02:36,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 198 states have (on average 1.3686868686868687) internal successors, (271), 237 states have internal predecessors, (271), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:02:36,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 279 transitions. [2024-11-28 03:02:36,872 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 279 transitions. Word has length 75 [2024-11-28 03:02:36,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:02:36,873 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 279 transitions. [2024-11-28 03:02:36,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 32 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:02:36,873 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 279 transitions. [2024-11-28 03:02:36,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-28 03:02:36,876 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:02:36,876 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:02:36,887 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 03:02:37,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:02:37,080 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-28 03:02:37,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:02:37,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1317970019, now seen corresponding path program 1 times [2024-11-28 03:02:37,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:02:37,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885142860] [2024-11-28 03:02:37,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:02:37,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:02:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:02:37,310 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:02:37,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:02:37,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885142860] [2024-11-28 03:02:37,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885142860] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:02:37,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998180404] [2024-11-28 03:02:37,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:02:37,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:02:37,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:02:37,313 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:02:37,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 03:02:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:02:37,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 03:02:37,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:02:37,753 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:02:37,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:02:37,790 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:02:37,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998180404] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:02:37,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:02:37,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-28 03:02:37,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260092997] [2024-11-28 03:02:37,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:02:37,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:02:37,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:02:37,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:02:37,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:02:37,791 INFO L87 Difference]: Start difference. First operand 244 states and 279 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:02:37,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:02:37,836 INFO L93 Difference]: Finished difference Result 273 states and 307 transitions. [2024-11-28 03:02:37,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:02:37,842 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (1), 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 81 [2024-11-28 03:02:37,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:02:37,844 INFO L225 Difference]: With dead ends: 273 [2024-11-28 03:02:37,844 INFO L226 Difference]: Without dead ends: 273 [2024-11-28 03:02:37,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:02:37,845 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 18 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:02:37,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 565 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:02:37,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-28 03:02:37,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 268. [2024-11-28 03:02:37,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 222 states have (on average 1.3468468468468469) internal successors, (299), 261 states have internal predecessors, (299), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:02:37,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 307 transitions. [2024-11-28 03:02:37,856 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 307 transitions. Word has length 81 [2024-11-28 03:02:37,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:02:37,856 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 307 transitions. [2024-11-28 03:02:37,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:02:37,857 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 307 transitions. [2024-11-28 03:02:37,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-28 03:02:37,857 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:02:37,857 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:02:37,870 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 03:02:38,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:02:38,058 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-28 03:02:38,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:02:38,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1457513328, now seen corresponding path program 2 times [2024-11-28 03:02:38,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:02:38,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740599863] [2024-11-28 03:02:38,059 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:02:38,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:02:38,267 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:02:38,268 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:02:40,006 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:02:40,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:02:40,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740599863] [2024-11-28 03:02:40,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740599863] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:02:40,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532677165] [2024-11-28 03:02:40,007 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:02:40,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:02:40,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:02:40,010 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:02:40,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 03:02:40,552 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:02:40,552 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:02:40,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 1290 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-28 03:02:40,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:02:40,569 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 10 treesize of output 8 [2024-11-28 03:02:40,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 03:02:40,598 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:02:40,598 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-28 03:02:40,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-28 03:02:40,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-28 03:02:40,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2024-11-28 03:02:40,714 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 20 treesize of output 15 [2024-11-28 03:02:40,810 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:02:40,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-28 03:02:40,819 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 36 treesize of output 15 [2024-11-28 03:02:40,959 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:02:40,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-28 03:02:40,965 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 36 treesize of output 15 [2024-11-28 03:02:41,111 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:02:41,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-28 03:02:41,119 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 36 treesize of output 15 [2024-11-28 03:02:41,242 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:02:41,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-28 03:02:41,250 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 36 treesize of output 15 [2024-11-28 03:02:41,314 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 37 treesize of output 13 [2024-11-28 03:02:41,318 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 11 treesize of output 3 [2024-11-28 03:02:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:02:41,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:02:41,623 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2360 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2360) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 1))) (forall ((v_ArrVal_2359 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2360) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2359) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2024-11-28 03:02:41,644 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2359 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2360) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2359) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2360 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2360) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 2)))))) is different from false [2024-11-28 03:02:41,657 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2357) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2358) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_2360) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_2359 (Array Int Int)) (v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2358))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2357) .cse1 v_ArrVal_2360) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2359) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))))) is different from false [2024-11-28 03:02:41,895 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int)) (v_ArrVal_2356 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2355))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2356) .cse0 v_ArrVal_2357) (select (select (store .cse1 .cse0 v_ArrVal_2358) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2360))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 3))) (forall ((v_ArrVal_2359 (Array Int Int)) (v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int)) (v_ArrVal_2356 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2355))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2358))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2356) .cse3 v_ArrVal_2357) .cse4 v_ArrVal_2360) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 4) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2359) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))) is different from false [2024-11-28 03:02:41,927 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2359 (Array Int Int)) (v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int)) (v_ArrVal_2356 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2355))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2358))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2356) .cse1 v_ArrVal_2357) .cse2 v_ArrVal_2360) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 4) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2359) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int)) (v_ArrVal_2356 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2355))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2356) .cse6 v_ArrVal_2357) (select (select (store .cse7 .cse6 v_ArrVal_2358) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2360))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 3)))))) is different from false [2024-11-28 03:02:41,961 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2359 (Array Int Int)) (v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int)) (v_ArrVal_2356 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2355))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2358))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2356) .cse1 v_ArrVal_2357) .cse2 v_ArrVal_2360) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 4) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2359) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int)) (v_ArrVal_2356 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2355))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2356) .cse6 v_ArrVal_2357) (select (select (store .cse7 .cse6 v_ArrVal_2358) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2360))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 3)))))) is different from false [2024-11-28 03:02:42,261 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int)) (v_ArrVal_2356 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2353 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2354))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2355))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2353) .cse0 v_ArrVal_2356) .cse1 v_ArrVal_2357) (select (select (store .cse2 .cse1 v_ArrVal_2358) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2360))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 3))) (forall ((v_ArrVal_2359 (Array Int Int)) (v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int)) (v_ArrVal_2356 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2353 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2354))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2355))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2358))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2353) .cse5 v_ArrVal_2356) .cse6 v_ArrVal_2357) .cse7 v_ArrVal_2360) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 4) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2359) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))))) is different from false [2024-11-28 03:02:42,523 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (and (forall ((v_ArrVal_2359 (Array Int Int)) (v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int)) (v_ArrVal_2356 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2353 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2354))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2355))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_2358))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2353) .cse1 v_ArrVal_2356) .cse2 v_ArrVal_2357) .cse3 v_ArrVal_2360) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 4) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_2359) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int)) (v_ArrVal_2356 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2353 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2354))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_2355))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2353) .cse8 v_ArrVal_2356) .cse9 v_ArrVal_2357) (select (select (store .cse10 .cse9 v_ArrVal_2358) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_2360))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 3)))))) is different from false [2024-11-28 03:02:42,989 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int)) (v_ArrVal_2356 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2353 (Array Int Int)) (v_ArrVal_2352 (Array Int Int)) (v_ArrVal_2351 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2351))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2354))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2355))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2352) .cse0 v_ArrVal_2353) .cse1 v_ArrVal_2356) .cse2 v_ArrVal_2357) (select (select (store .cse3 .cse2 v_ArrVal_2358) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_2360))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 3))) (forall ((v_ArrVal_2359 (Array Int Int)) (v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int)) (v_ArrVal_2356 (Array Int Int)) (v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2353 (Array Int Int)) (v_ArrVal_2352 (Array Int Int)) (v_ArrVal_2351 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2351))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2354))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2355))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2358))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2352) .cse7 v_ArrVal_2353) .cse8 v_ArrVal_2356) .cse9 v_ArrVal_2357) .cse10 v_ArrVal_2360) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 4) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_2359) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))))))) is different from false [2024-11-28 03:02:43,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:43,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 418 treesize of output 419 [2024-11-28 03:02:43,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:43,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 406 treesize of output 239 [2024-11-28 03:02:43,111 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 343996 treesize of output 292020 [2024-11-28 03:02:43,386 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 764514 treesize of output 757898 [2024-11-28 03:02:43,475 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 796 treesize of output 724 [2024-11-28 03:02:43,481 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 724 treesize of output 688 [2024-11-28 03:02:43,487 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 688 treesize of output 616 [2024-11-28 03:02:43,494 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 616 treesize of output 520 [2024-11-28 03:02:43,500 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 520 treesize of output 436 [2024-11-28 03:02:43,507 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 436 treesize of output 424 [2024-11-28 03:02:43,517 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 229 treesize of output 199 [2024-11-28 03:02:43,530 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 394 treesize of output 382 [2024-11-28 03:02:43,566 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 193 treesize of output 187 [2024-11-28 03:02:43,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:43,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 833 treesize of output 834 [2024-11-28 03:02:43,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:02:43,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 821 treesize of output 462 [2024-11-28 03:02:43,737 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:02:43,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 426750 treesize of output 333350 [2024-11-28 03:02:43,893 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:02:43,893 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:02:43,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 28 treesize of output 12 [2024-11-28 03:02:44,085 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:02:44,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-28 03:02:44,100 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 190 trivial. 22 not checked. [2024-11-28 03:02:44,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532677165] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:02:44,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:02:44,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 19] total 45 [2024-11-28 03:02:44,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407613823] [2024-11-28 03:02:44,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:02:44,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-28 03:02:44,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:02:44,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-28 03:02:44,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1142, Unknown=27, NotChecked=702, Total=2070 [2024-11-28 03:02:44,103 INFO L87 Difference]: Start difference. First operand 268 states and 307 transitions. Second operand has 46 states, 45 states have (on average 2.3555555555555556) internal successors, (106), 46 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:02:49,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:02:49,826 INFO L93 Difference]: Finished difference Result 321 states and 354 transitions. [2024-11-28 03:02:49,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 03:02:49,827 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.3555555555555556) internal successors, (106), 46 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2024-11-28 03:02:49,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:02:49,828 INFO L225 Difference]: With dead ends: 321 [2024-11-28 03:02:49,828 INFO L226 Difference]: Without dead ends: 321 [2024-11-28 03:02:49,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 143 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=514, Invalid=2546, Unknown=56, NotChecked=1044, Total=4160 [2024-11-28 03:02:49,830 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 477 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 32 mSolverCounterUnsat, 29 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 3936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 29 IncrementalHoareTripleChecker+Unknown, 2097 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:02:49,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 1792 Invalid, 3936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1778 Invalid, 29 Unknown, 2097 Unchecked, 2.8s Time] [2024-11-28 03:02:49,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-28 03:02:49,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 284. [2024-11-28 03:02:49,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 238 states have (on average 1.3235294117647058) internal successors, (315), 277 states have internal predecessors, (315), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:02:49,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 323 transitions. [2024-11-28 03:02:49,838 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 323 transitions. Word has length 85 [2024-11-28 03:02:49,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:02:49,839 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 323 transitions. [2024-11-28 03:02:49,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.3555555555555556) internal successors, (106), 46 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:02:49,839 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 323 transitions. [2024-11-28 03:02:49,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-28 03:02:49,840 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:02:49,840 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 6, 6, 6, 6, 6, 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] [2024-11-28 03:02:49,853 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 03:02:50,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-28 03:02:50,044 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-28 03:02:50,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:02:50,045 INFO L85 PathProgramCache]: Analyzing trace with hash -603672867, now seen corresponding path program 2 times [2024-11-28 03:02:50,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:02:50,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455822202] [2024-11-28 03:02:50,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:02:50,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:02:50,181 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:02:50,181 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:02:50,522 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 3 proven. 81 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:02:50,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:02:50,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455822202] [2024-11-28 03:02:50,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455822202] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:02:50,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794576185] [2024-11-28 03:02:50,523 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:02:50,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:02:50,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:02:50,525 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:02:50,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 03:02:50,979 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:02:50,979 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:02:50,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 1382 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 03:02:50,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:02:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 3 proven. 81 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:02:51,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:02:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 3 proven. 81 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:02:51,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794576185] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:02:51,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:02:51,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2024-11-28 03:02:51,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186701469] [2024-11-28 03:02:51,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:02:51,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 03:02:51,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:02:51,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 03:02:51,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:02:51,208 INFO L87 Difference]: Start difference. First operand 284 states and 323 transitions. Second operand has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:02:51,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:02:51,312 INFO L93 Difference]: Finished difference Result 317 states and 351 transitions. [2024-11-28 03:02:51,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:02:51,313 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 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 101 [2024-11-28 03:02:51,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:02:51,314 INFO L225 Difference]: With dead ends: 317 [2024-11-28 03:02:51,314 INFO L226 Difference]: Without dead ends: 317 [2024-11-28 03:02:51,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 194 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:02:51,315 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 34 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:02:51,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 304 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:02:51,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-28 03:02:51,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 308. [2024-11-28 03:02:51,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 262 states have (on average 1.3091603053435115) internal successors, (343), 301 states have internal predecessors, (343), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:02:51,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 351 transitions. [2024-11-28 03:02:51,326 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 351 transitions. Word has length 101 [2024-11-28 03:02:51,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:02:51,326 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 351 transitions. [2024-11-28 03:02:51,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 03:02:51,326 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 351 transitions. [2024-11-28 03:02:51,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-28 03:02:51,327 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:02:51,327 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:02:51,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 03:02:51,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-28 03:02:51,528 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2024-11-28 03:02:51,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:02:51,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1359361072, now seen corresponding path program 3 times [2024-11-28 03:02:51,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:02:51,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866712551] [2024-11-28 03:02:51,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:02:51,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:02:52,597 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-28 03:02:52,597 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:02:55,948 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:02:55,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:02:55,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866712551] [2024-11-28 03:02:55,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866712551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:02:55,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612089634] [2024-11-28 03:02:55,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:02:55,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:02:55,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:02:55,953 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:02:55,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_349d0bb8-9f1d-4812-a2df-8b06cfbc769c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 03:03:05,819 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-28 03:03:05,819 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:03:05,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 1343 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-28 03:03:05,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:03:05,839 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 10 treesize of output 8 [2024-11-28 03:03:05,995 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:03:05,995 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-28 03:03:06,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 03:03:06,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-28 03:03:06,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-28 03:03:06,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2024-11-28 03:03:06,230 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 20 treesize of output 15 [2024-11-28 03:03:06,418 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:03:06,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-28 03:03:06,433 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 36 treesize of output 15 [2024-11-28 03:03:06,692 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:03:06,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-28 03:03:06,706 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 36 treesize of output 15 [2024-11-28 03:03:07,065 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:03:07,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-28 03:03:07,081 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 36 treesize of output 15 [2024-11-28 03:03:07,359 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:03:07,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-28 03:03:07,371 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 36 treesize of output 15 [2024-11-28 03:03:07,643 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:03:07,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-28 03:03:07,662 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 36 treesize of output 15 [2024-11-28 03:03:08,042 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:03:08,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-28 03:03:08,057 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 36 treesize of output 15 [2024-11-28 03:03:08,371 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 03:03:08,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2024-11-28 03:03:08,383 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 36 treesize of output 15 [2024-11-28 03:03:08,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:03:08,695 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 93 treesize of output 47 [2024-11-28 03:03:08,700 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 36 treesize of output 15 [2024-11-28 03:03:08,852 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 37 treesize of output 13 [2024-11-28 03:03:08,865 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 11 treesize of output 3 [2024-11-28 03:03:08,968 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 03:03:08,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:03:09,559 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (and (forall ((|v_ULTIMATE.start_main_#t~mem158#1.offset_26| Int)) (or (< |v_ULTIMATE.start_main_#t~mem158#1.offset_26| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (forall ((v_ArrVal_2957 (Array Int Int)) (v_ArrVal_2958 Int)) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2957) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (+ |c_ULTIMATE.start_main_~j~0#1| |v_ULTIMATE.start_main_#t~mem158#1.offset_26|) v_ArrVal_2958)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))) (forall ((v_ArrVal_2957 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2957) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1)))))) is different from false [2024-11-28 03:03:09,598 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2957 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2957) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2))) (forall ((|v_ULTIMATE.start_main_#t~mem158#1.offset_26| Int)) (or (forall ((v_ArrVal_2957 (Array Int Int)) (v_ArrVal_2958 Int)) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2957) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (+ |c_ULTIMATE.start_main_~j~0#1| |v_ULTIMATE.start_main_#t~mem158#1.offset_26| 1) v_ArrVal_2958)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (< |v_ULTIMATE.start_main_#t~mem158#1.offset_26| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2024-11-28 03:03:10,333 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2954 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2954))) (or (forall ((v_ArrVal_2957 (Array Int Int)) (v_ArrVal_2956 (Array Int Int)) (v_ArrVal_2955 (Array Int Int)) (v_ArrVal_2953 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2953))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store .cse0 .cse1 v_ArrVal_2956) (select (select (store .cse2 .cse1 v_ArrVal_2955) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2957))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 3))) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 1) 0)))) (forall ((v_ArrVal_2954 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2954))) (or (< (+ (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 1) 0) (forall ((v_ArrVal_2956 (Array Int Int)) (v_ArrVal_2955 (Array Int Int)) (v_ArrVal_2953 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem158#1.offset_26| Int)) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2953))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse4 .cse9 v_ArrVal_2956))) (or (< |v_ULTIMATE.start_main_#t~mem158#1.offset_26| (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (forall ((v_ArrVal_2957 (Array Int Int)) (v_ArrVal_2958 Int)) (let ((.cse7 (store .cse8 .cse9 v_ArrVal_2955))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ (select (select (store .cse5 .cse6 v_ArrVal_2957) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 4) (select |c_#length| (select (select (store .cse7 .cse6 (store (select .cse7 .cse6) (+ |c_ULTIMATE.start_main_~j~0#1| 2 |v_ULTIMATE.start_main_#t~mem158#1.offset_26|) v_ArrVal_2958)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))))))))) is different from false [2024-11-28 03:03:11,322 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2954 (Array Int Int)) (v_ArrVal_2952 (Array Int Int)) (v_ArrVal_2951 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2951))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2952) .cse8 v_ArrVal_2954))) (or (forall ((v_ArrVal_2956 (Array Int Int)) (v_ArrVal_2955 (Array Int Int)) (v_ArrVal_2953 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem158#1.offset_26| Int)) (let ((.cse4 (store .cse7 .cse8 v_ArrVal_2953))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse0 (store .cse6 .cse5 v_ArrVal_2956))) (or (forall ((v_ArrVal_2957 (Array Int Int)) (v_ArrVal_2958 Int)) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_2955))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 5 (select (select (store .cse0 .cse1 v_ArrVal_2957) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 (store (select .cse3 .cse1) (+ |c_ULTIMATE.start_main_~j~0#1| 3 |v_ULTIMATE.start_main_#t~mem158#1.offset_26|) v_ArrVal_2958)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (< |v_ULTIMATE.start_main_#t~mem158#1.offset_26| (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))))) (< (+ |c_ULTIMATE.start_main_~j~0#1| (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 2) 0)))))) (forall ((v_ArrVal_2954 (Array Int Int)) (v_ArrVal_2952 (Array Int Int)) (v_ArrVal_2951 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2951))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2952) .cse13 v_ArrVal_2954))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 2) 0) (forall ((v_ArrVal_2957 (Array Int Int)) (v_ArrVal_2956 (Array Int Int)) (v_ArrVal_2955 (Array Int Int)) (v_ArrVal_2953 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (let ((.cse11 (store .cse12 .cse13 v_ArrVal_2953))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store .cse9 .cse10 v_ArrVal_2956) (select (select (store .cse11 .cse10 v_ArrVal_2955) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2957))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 4)))))))))) is different from false [2024-11-28 03:03:11,413 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2954 (Array Int Int)) (v_ArrVal_2952 (Array Int Int)) (v_ArrVal_2951 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_2951))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_2952) .cse8 v_ArrVal_2954))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_2956 (Array Int Int)) (v_ArrVal_2955 (Array Int Int)) (v_ArrVal_2953 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem158#1.offset_26| Int)) (let ((.cse5 (store .cse7 .cse8 v_ArrVal_2953))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse2 (store .cse0 .cse6 v_ArrVal_2956))) (or (< |v_ULTIMATE.start_main_#t~mem158#1.offset_26| (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (forall ((v_ArrVal_2957 (Array Int Int)) (v_ArrVal_2958 Int)) (let ((.cse4 (store .cse5 .cse6 v_ArrVal_2955))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 5 (select (select (store .cse2 .cse3 v_ArrVal_2957) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse4 .cse3 (store (select .cse4 .cse3) (+ |c_ULTIMATE.start_main_~j~0#1| 3 |v_ULTIMATE.start_main_#t~mem158#1.offset_26|) v_ArrVal_2958)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))))))))))))) (forall ((v_ArrVal_2954 (Array Int Int)) (v_ArrVal_2952 (Array Int Int)) (v_ArrVal_2951 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_2951))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse10 (store (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_2952) .cse14 v_ArrVal_2954))) (or (forall ((v_ArrVal_2957 (Array Int Int)) (v_ArrVal_2956 (Array Int Int)) (v_ArrVal_2955 (Array Int Int)) (v_ArrVal_2953 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (let ((.cse12 (store .cse13 .cse14 v_ArrVal_2953))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (store (store .cse10 .cse11 v_ArrVal_2956) (select (select (store .cse12 .cse11 v_ArrVal_2955) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2957))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 4))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) 0))))))))) is different from false [2024-11-28 03:03:11,503 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2954 (Array Int Int)) (v_ArrVal_2952 (Array Int Int)) (v_ArrVal_2951 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_2951))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_2952) .cse8 v_ArrVal_2954))) (or (forall ((v_ArrVal_2956 (Array Int Int)) (v_ArrVal_2955 (Array Int Int)) (v_ArrVal_2953 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem158#1.offset_26| Int)) (let ((.cse4 (store .cse7 .cse8 v_ArrVal_2953))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse0 (store .cse6 .cse5 v_ArrVal_2956))) (or (< |v_ULTIMATE.start_main_#t~mem158#1.offset_26| (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (forall ((v_ArrVal_2957 (Array Int Int)) (v_ArrVal_2958 Int)) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_2955))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 6 (select (select (store .cse0 .cse2 v_ArrVal_2957) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 (store (select .cse3 .cse2) (+ |c_ULTIMATE.start_main_~j~0#1| |v_ULTIMATE.start_main_#t~mem158#1.offset_26| 4) v_ArrVal_2958)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))))))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) 0)))))) (forall ((v_ArrVal_2954 (Array Int Int)) (v_ArrVal_2952 (Array Int Int)) (v_ArrVal_2951 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_2951))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse10 (store (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_2952) .cse14 v_ArrVal_2954))) (or (forall ((v_ArrVal_2957 (Array Int Int)) (v_ArrVal_2956 (Array Int Int)) (v_ArrVal_2955 (Array Int Int)) (v_ArrVal_2953 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 5 (select (select (let ((.cse12 (store .cse13 .cse14 v_ArrVal_2953))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (store (store .cse10 .cse11 v_ArrVal_2956) (select (select (store .cse12 .cse11 v_ArrVal_2955) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2957))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) 0))))))))) is different from false [2024-11-28 03:03:12,235 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2954 (Array Int Int)) (v_ArrVal_2952 (Array Int Int)) (v_ArrVal_2951 (Array Int Int)) (v_ArrVal_2950 (Array Int Int)) (v_ArrVal_2949 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_2949))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse4 (store .cse8 .cse7 v_ArrVal_2951))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_2950) .cse7 v_ArrVal_2952) .cse5 v_ArrVal_2954))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_2957 (Array Int Int)) (v_ArrVal_2956 (Array Int Int)) (v_ArrVal_2955 (Array Int Int)) (v_ArrVal_2953 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 5 (select (select (let ((.cse3 (store .cse4 .cse5 v_ArrVal_2953))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (store (store .cse0 .cse2 v_ArrVal_2956) (select (select (store .cse3 .cse2 v_ArrVal_2955) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2957))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))))))) (forall ((v_ArrVal_2954 (Array Int Int)) (v_ArrVal_2952 (Array Int Int)) (v_ArrVal_2951 (Array Int Int)) (v_ArrVal_2950 (Array Int Int)) (v_ArrVal_2949 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_2949))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse15 (store .cse18 .cse17 v_ArrVal_2951))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse14 (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_2950) .cse17 v_ArrVal_2952) .cse16 v_ArrVal_2954))) (or (forall ((v_ArrVal_2956 (Array Int Int)) (v_ArrVal_2955 (Array Int Int)) (v_ArrVal_2953 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem158#1.offset_26| Int)) (let ((.cse12 (store .cse15 .cse16 v_ArrVal_2953))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse9 (store .cse14 .cse13 v_ArrVal_2956))) (or (forall ((v_ArrVal_2957 (Array Int Int)) (v_ArrVal_2958 Int)) (let ((.cse11 (store .cse12 .cse13 v_ArrVal_2955))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store .cse9 .cse10 v_ArrVal_2957) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 6) (select |c_#length| (select (select (store .cse11 .cse10 (store (select .cse11 .cse10) (+ |c_ULTIMATE.start_main_~j~0#1| |v_ULTIMATE.start_main_#t~mem158#1.offset_26| 4) v_ArrVal_2958)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (< |v_ULTIMATE.start_main_#t~mem158#1.offset_26| (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) 0))))))))))) is different from false [2024-11-28 03:03:15,056 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2946 (Array Int Int)) (v_ArrVal_2945 (Array Int Int)) (v_ArrVal_2954 (Array Int Int)) (v_ArrVal_2952 (Array Int Int)) (v_ArrVal_2951 (Array Int Int)) (v_ArrVal_2950 (Array Int Int)) (v_ArrVal_2949 (Array Int Int)) (v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2947 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2945))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2947))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2949))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse9 .cse8 v_ArrVal_2951))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse0 (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2946) .cse6 v_ArrVal_2948) .cse7 v_ArrVal_2950) .cse8 v_ArrVal_2952) .cse5 v_ArrVal_2954))) (or (forall ((v_ArrVal_2957 (Array Int Int)) (v_ArrVal_2956 (Array Int Int)) (v_ArrVal_2955 (Array Int Int)) (v_ArrVal_2953 (Array Int Int))) (<= 0 (+ 7 |c_ULTIMATE.start_main_~j~0#1| (select (select (let ((.cse2 (store .cse4 .cse5 v_ArrVal_2953))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store .cse0 .cse1 v_ArrVal_2956) (select (select (store .cse2 .cse1 v_ArrVal_2955) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2957))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))) (< (+ |c_ULTIMATE.start_main_~j~0#1| (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 5) 0)))))))))))) (forall ((v_ArrVal_2946 (Array Int Int)) (v_ArrVal_2945 (Array Int Int)) (v_ArrVal_2954 (Array Int Int)) (v_ArrVal_2952 (Array Int Int)) (v_ArrVal_2951 (Array Int Int)) (v_ArrVal_2950 (Array Int Int)) (v_ArrVal_2949 (Array Int Int)) (v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2947 (Array Int Int))) (let ((.cse25 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2945))) (let ((.cse20 (select (select .cse25 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse24 (store .cse25 .cse20 v_ArrVal_2947))) (let ((.cse21 (select (select .cse24 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse23 (store .cse24 .cse21 v_ArrVal_2949))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse18 (store .cse23 .cse22 v_ArrVal_2951))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse12 (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2946) .cse20 v_ArrVal_2948) .cse21 v_ArrVal_2950) .cse22 v_ArrVal_2952) .cse19 v_ArrVal_2954))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 5) 0) (forall ((v_ArrVal_2956 (Array Int Int)) (v_ArrVal_2955 (Array Int Int)) (v_ArrVal_2953 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem158#1.offset_26| Int)) (let ((.cse16 (store .cse18 .cse19 v_ArrVal_2953))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse13 (store .cse12 .cse17 v_ArrVal_2956))) (or (< |v_ULTIMATE.start_main_#t~mem158#1.offset_26| (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (forall ((v_ArrVal_2957 (Array Int Int)) (v_ArrVal_2958 Int)) (let ((.cse15 (store .cse16 .cse17 v_ArrVal_2955))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 8 (select (select (store .cse13 .cse14 v_ArrVal_2957) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse15 .cse14 (store (select .cse15 .cse14) (+ |c_ULTIMATE.start_main_~j~0#1| 6 |v_ULTIMATE.start_main_#t~mem158#1.offset_26|) v_ArrVal_2958)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))))))))))))))))) is different from false [2024-11-28 03:03:15,188 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2946 (Array Int Int)) (v_ArrVal_2945 (Array Int Int)) (v_ArrVal_2954 (Array Int Int)) (v_ArrVal_2952 (Array Int Int)) (v_ArrVal_2951 (Array Int Int)) (v_ArrVal_2950 (Array Int Int)) (v_ArrVal_2949 (Array Int Int)) (v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2947 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_2945))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_2947))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_2949))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse7 (store .cse13 .cse12 v_ArrVal_2951))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse0 (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_2946) .cse10 v_ArrVal_2948) .cse11 v_ArrVal_2950) .cse12 v_ArrVal_2952) .cse8 v_ArrVal_2954))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| 5 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_2956 (Array Int Int)) (v_ArrVal_2955 (Array Int Int)) (v_ArrVal_2953 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem158#1.offset_26| Int)) (let ((.cse5 (store .cse7 .cse8 v_ArrVal_2953))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse2 (store .cse0 .cse6 v_ArrVal_2956))) (or (forall ((v_ArrVal_2957 (Array Int Int)) (v_ArrVal_2958 Int)) (let ((.cse4 (store .cse5 .cse6 v_ArrVal_2955))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ (select (select (store .cse2 .cse3 v_ArrVal_2957) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 8) (select |c_#length| (select (select (store .cse4 .cse3 (store (select .cse4 .cse3) (+ |c_ULTIMATE.start_main_~j~0#1| 6 |v_ULTIMATE.start_main_#t~mem158#1.offset_26|) v_ArrVal_2958)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (< |v_ULTIMATE.start_main_#t~mem158#1.offset_26| (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))))))))))))))) (forall ((v_ArrVal_2946 (Array Int Int)) (v_ArrVal_2945 (Array Int Int)) (v_ArrVal_2954 (Array Int Int)) (v_ArrVal_2952 (Array Int Int)) (v_ArrVal_2951 (Array Int Int)) (v_ArrVal_2950 (Array Int Int)) (v_ArrVal_2949 (Array Int Int)) (v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2947 (Array Int Int))) (let ((.cse26 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_2945))) (let ((.cse21 (select (select .cse26 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse25 (store .cse26 .cse21 v_ArrVal_2947))) (let ((.cse22 (select (select .cse25 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse24 (store .cse25 .cse22 v_ArrVal_2949))) (let ((.cse23 (select (select .cse24 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse19 (store .cse24 .cse23 v_ArrVal_2951))) (let ((.cse20 (select (select .cse19 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse16 (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_2946) .cse21 v_ArrVal_2948) .cse22 v_ArrVal_2950) .cse23 v_ArrVal_2952) .cse20 v_ArrVal_2954))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| 5 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_2957 (Array Int Int)) (v_ArrVal_2956 (Array Int Int)) (v_ArrVal_2955 (Array Int Int)) (v_ArrVal_2953 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse18 (store .cse19 .cse20 v_ArrVal_2953))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (store (store .cse16 .cse17 v_ArrVal_2956) (select (select (store .cse18 .cse17 v_ArrVal_2955) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2957))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 7 |c_ULTIMATE.start_main_~j~0#1|))))))))))))))))) is different from false [2024-11-28 03:03:15,307 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2946 (Array Int Int)) (v_ArrVal_2945 (Array Int Int)) (v_ArrVal_2954 (Array Int Int)) (v_ArrVal_2952 (Array Int Int)) (v_ArrVal_2951 (Array Int Int)) (v_ArrVal_2950 (Array Int Int)) (v_ArrVal_2949 (Array Int Int)) (v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2947 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_2945))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_2947))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_2949))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse4 (store .cse10 .cse9 v_ArrVal_2951))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse0 (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_2946) .cse7 v_ArrVal_2948) .cse8 v_ArrVal_2950) .cse9 v_ArrVal_2952) .cse5 v_ArrVal_2954))) (or (< (+ 5 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_2957 (Array Int Int)) (v_ArrVal_2956 (Array Int Int)) (v_ArrVal_2955 (Array Int Int)) (v_ArrVal_2953 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse3 (store .cse4 .cse5 v_ArrVal_2953))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (store (store .cse0 .cse2 v_ArrVal_2956) (select (select (store .cse3 .cse2 v_ArrVal_2955) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2957))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 7)))))))))))))) (forall ((v_ArrVal_2946 (Array Int Int)) (v_ArrVal_2945 (Array Int Int)) (v_ArrVal_2954 (Array Int Int)) (v_ArrVal_2952 (Array Int Int)) (v_ArrVal_2951 (Array Int Int)) (v_ArrVal_2950 (Array Int Int)) (v_ArrVal_2949 (Array Int Int)) (v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2947 (Array Int Int))) (let ((.cse26 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_2945))) (let ((.cse21 (select (select .cse26 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse25 (store .cse26 .cse21 v_ArrVal_2947))) (let ((.cse22 (select (select .cse25 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse24 (store .cse25 .cse22 v_ArrVal_2949))) (let ((.cse23 (select (select .cse24 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse19 (store .cse24 .cse23 v_ArrVal_2951))) (let ((.cse20 (select (select .cse19 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse18 (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_2946) .cse21 v_ArrVal_2948) .cse22 v_ArrVal_2950) .cse23 v_ArrVal_2952) .cse20 v_ArrVal_2954))) (or (forall ((v_ArrVal_2956 (Array Int Int)) (v_ArrVal_2955 (Array Int Int)) (v_ArrVal_2953 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem158#1.offset_26| Int)) (let ((.cse16 (store .cse19 .cse20 v_ArrVal_2953))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse13 (store .cse18 .cse17 v_ArrVal_2956))) (or (forall ((v_ArrVal_2957 (Array Int Int)) (v_ArrVal_2958 Int)) (let ((.cse15 (store .cse16 .cse17 v_ArrVal_2955))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ (select (select (store .cse13 .cse14 v_ArrVal_2957) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse15 .cse14 (store (select .cse15 .cse14) (+ 6 |v_ULTIMATE.start_main_#t~mem158#1.offset_26|) v_ArrVal_2958)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (< |v_ULTIMATE.start_main_#t~mem158#1.offset_26| (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) (< (+ 5 (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) 0))))))))))))))) is different from false [2024-11-28 03:03:15,400 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2946 (Array Int Int)) (v_ArrVal_2945 (Array Int Int)) (v_ArrVal_2944 (Array Int Int)) (v_ArrVal_2943 (Array Int Int)) (v_ArrVal_2954 (Array Int Int)) (v_ArrVal_2952 (Array Int Int)) (v_ArrVal_2951 (Array Int Int)) (v_ArrVal_2950 (Array Int Int)) (v_ArrVal_2949 (Array Int Int)) (v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2947 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2944))) (let ((.cse6 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse12 (store .cse13 .cse6 v_ArrVal_2945))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_2947))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_2949))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse10 .cse9 v_ArrVal_2951))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse0 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2943) .cse6 v_ArrVal_2946) .cse7 v_ArrVal_2948) .cse8 v_ArrVal_2950) .cse9 v_ArrVal_2952) .cse5 v_ArrVal_2954))) (or (forall ((v_ArrVal_2957 (Array Int Int)) (v_ArrVal_2956 (Array Int Int)) (v_ArrVal_2955 (Array Int Int)) (v_ArrVal_2953 (Array Int Int))) (<= 0 (+ 7 (select (select (let ((.cse2 (store .cse4 .cse5 v_ArrVal_2953))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store .cse0 .cse1 v_ArrVal_2956) (select (select (store .cse2 .cse1 v_ArrVal_2955) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2957))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 5) 0)))))))))))))) (forall ((v_ArrVal_2946 (Array Int Int)) (v_ArrVal_2945 (Array Int Int)) (v_ArrVal_2944 (Array Int Int)) (v_ArrVal_2943 (Array Int Int)) (v_ArrVal_2954 (Array Int Int)) (v_ArrVal_2952 (Array Int Int)) (v_ArrVal_2951 (Array Int Int)) (v_ArrVal_2950 (Array Int Int)) (v_ArrVal_2949 (Array Int Int)) (v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2947 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2944))) (let ((.cse22 (select (select .cse29 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse28 (store .cse29 .cse22 v_ArrVal_2945))) (let ((.cse23 (select (select .cse28 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse27 (store .cse28 .cse23 v_ArrVal_2947))) (let ((.cse24 (select (select .cse27 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse26 (store .cse27 .cse24 v_ArrVal_2949))) (let ((.cse25 (select (select .cse26 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse20 (store .cse26 .cse25 v_ArrVal_2951))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse19 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2943) .cse22 v_ArrVal_2946) .cse23 v_ArrVal_2948) .cse24 v_ArrVal_2950) .cse25 v_ArrVal_2952) .cse21 v_ArrVal_2954))) (or (forall ((v_ArrVal_2956 (Array Int Int)) (v_ArrVal_2955 (Array Int Int)) (v_ArrVal_2953 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem158#1.offset_26| Int)) (let ((.cse17 (store .cse20 .cse21 v_ArrVal_2953))) (let ((.cse18 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse14 (store .cse19 .cse18 v_ArrVal_2956))) (or (< |v_ULTIMATE.start_main_#t~mem158#1.offset_26| (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (forall ((v_ArrVal_2957 (Array Int Int)) (v_ArrVal_2958 Int)) (let ((.cse16 (store .cse17 .cse18 v_ArrVal_2955))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ (select (select (store .cse14 .cse15 v_ArrVal_2957) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 8) (select |c_#length| (select (select (store .cse16 .cse15 (store (select .cse16 .cse15) (+ 6 |v_ULTIMATE.start_main_#t~mem158#1.offset_26|) v_ArrVal_2958)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))))) (< (+ (select (select .cse19 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 5) 0)))))))))))))))) is different from false [2024-11-28 03:03:18,476 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2946 (Array Int Int)) (v_ArrVal_2945 (Array Int Int)) (v_ArrVal_2944 (Array Int Int)) (v_ArrVal_2943 (Array Int Int)) (v_ArrVal_2954 (Array Int Int)) (v_ArrVal_2942 (Array Int Int)) (v_ArrVal_2941 (Array Int Int)) (v_ArrVal_2952 (Array Int Int)) (v_ArrVal_2951 (Array Int Int)) (v_ArrVal_2950 (Array Int Int)) (v_ArrVal_2949 (Array Int Int)) (v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2947 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2942))) (let ((.cse6 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse6 v_ArrVal_2944))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2945))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2947))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2949))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse4 (store .cse11 .cse10 v_ArrVal_2951))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse0 (store (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2941) .cse6 v_ArrVal_2943) .cse7 v_ArrVal_2946) .cse8 v_ArrVal_2948) .cse9 v_ArrVal_2950) .cse10 v_ArrVal_2952) .cse5 v_ArrVal_2954))) (or (< (+ 5 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_2957 (Array Int Int)) (v_ArrVal_2956 (Array Int Int)) (v_ArrVal_2955 (Array Int Int)) (v_ArrVal_2953 (Array Int Int))) (<= 0 (+ 7 (select (select (let ((.cse3 (store .cse4 .cse5 v_ArrVal_2953))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (store (store .cse0 .cse2 v_ArrVal_2956) (select (select (store .cse3 .cse2 v_ArrVal_2955) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2957))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))))))))))))))) (forall ((v_ArrVal_2946 (Array Int Int)) (v_ArrVal_2945 (Array Int Int)) (v_ArrVal_2944 (Array Int Int)) (v_ArrVal_2943 (Array Int Int)) (v_ArrVal_2954 (Array Int Int)) (v_ArrVal_2942 (Array Int Int)) (v_ArrVal_2941 (Array Int Int)) (v_ArrVal_2952 (Array Int Int)) (v_ArrVal_2951 (Array Int Int)) (v_ArrVal_2950 (Array Int Int)) (v_ArrVal_2949 (Array Int Int)) (v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2947 (Array Int Int))) (let ((.cse33 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2942))) (let ((.cse24 (select (select .cse33 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse32 (store .cse33 .cse24 v_ArrVal_2944))) (let ((.cse25 (select (select .cse32 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse31 (store .cse32 .cse25 v_ArrVal_2945))) (let ((.cse26 (select (select .cse31 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse30 (store .cse31 .cse26 v_ArrVal_2947))) (let ((.cse27 (select (select .cse30 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse29 (store .cse30 .cse27 v_ArrVal_2949))) (let ((.cse28 (select (select .cse29 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse22 (store .cse29 .cse28 v_ArrVal_2951))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse16 (store (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2941) .cse24 v_ArrVal_2943) .cse25 v_ArrVal_2946) .cse26 v_ArrVal_2948) .cse27 v_ArrVal_2950) .cse28 v_ArrVal_2952) .cse23 v_ArrVal_2954))) (or (< (+ 5 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_2956 (Array Int Int)) (v_ArrVal_2955 (Array Int Int)) (v_ArrVal_2953 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem158#1.offset_26| Int)) (let ((.cse20 (store .cse22 .cse23 v_ArrVal_2953))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse17 (store .cse16 .cse21 v_ArrVal_2956))) (or (forall ((v_ArrVal_2957 (Array Int Int)) (v_ArrVal_2958 Int)) (let ((.cse19 (store .cse20 .cse21 v_ArrVal_2955))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ 8 (select (select (store .cse17 .cse18 v_ArrVal_2957) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse19 .cse18 (store (select .cse19 .cse18) (+ 6 |v_ULTIMATE.start_main_#t~mem158#1.offset_26|) v_ArrVal_2958)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (< |v_ULTIMATE.start_main_#t~mem158#1.offset_26| (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))))))))))))))))))))) is different from false [2024-11-28 03:03:18,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:03:18,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 8325 treesize of output 8313 [2024-11-28 03:03:18,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:03:18,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 8301 treesize of output 4497