./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/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_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5eb0e4c4138981b5d0263d433279609e9b809291f20fa6c19565d53ef342ae2b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:25:33,664 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:25:33,755 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-27 20:25:33,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:25:33,764 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:25:33,798 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:25:33,799 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:25:33,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:25:33,799 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:25:33,800 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:25:33,801 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:25:33,801 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:25:33,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:25:33,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:25:33,801 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:25:33,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:25:33,802 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:25:33,802 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:25:33,802 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:25:33,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:25:33,802 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 20:25:33,802 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 20:25:33,802 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 20:25:33,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:25:33,802 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:25:33,803 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 20:25:33,803 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:25:33,803 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:25:33,803 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:25:33,803 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:25:33,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:25:33,803 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:25:33,803 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:25:33,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:25:33,804 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:25:33,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:25:33,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:25:33,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:25:33,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:25:33,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:25:33,804 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:25:33,804 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:25:33,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:25:33,805 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:25:33,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:25:33,806 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:25:33,806 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:25:33,806 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_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5eb0e4c4138981b5d0263d433279609e9b809291f20fa6c19565d53ef342ae2b [2024-11-27 20:25:34,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:25:34,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:25:34,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:25:34,117 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:25:34,118 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:25:34,119 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i [2024-11-27 20:25:37,122 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/data/90e3d4ee3/df066a24114d41c3a76c5bc475d6d9e4/FLAG9b92bfc90 [2024-11-27 20:25:37,467 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:25:37,467 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i [2024-11-27 20:25:37,499 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/data/90e3d4ee3/df066a24114d41c3a76c5bc475d6d9e4/FLAG9b92bfc90 [2024-11-27 20:25:37,526 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/data/90e3d4ee3/df066a24114d41c3a76c5bc475d6d9e4 [2024-11-27 20:25:37,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:25:37,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:25:37,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:25:37,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:25:37,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:25:37,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:25:37" (1/1) ... [2024-11-27 20:25:37,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76cfbddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:25:37, skipping insertion in model container [2024-11-27 20:25:37,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:25:37" (1/1) ... [2024-11-27 20:25:37,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:25:38,205 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-27 20:25:38,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-27 20:25:38,266 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-27 20:25:38,272 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-27 20:25:38,284 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-27 20:25:38,325 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-27 20:25:38,326 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-27 20:25:38,329 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-27 20:25:38,329 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-27 20:25:38,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:25:38,349 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:25:38,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:25:38,526 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:25:38,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:25:38 WrapperNode [2024-11-27 20:25:38,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:25:38,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:25:38,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:25:38,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:25:38,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:25:38" (1/1) ... [2024-11-27 20:25:38,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:25:38" (1/1) ... [2024-11-27 20:25:38,671 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1282 [2024-11-27 20:25:38,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:25:38,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:25:38,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:25:38,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:25:38,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:25:38" (1/1) ... [2024-11-27 20:25:38,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:25:38" (1/1) ... [2024-11-27 20:25:38,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:25:38" (1/1) ... [2024-11-27 20:25:38,751 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2024-11-27 20:25:38,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:25:38" (1/1) ... [2024-11-27 20:25:38,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:25:38" (1/1) ... [2024-11-27 20:25:38,825 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:25:38" (1/1) ... [2024-11-27 20:25:38,827 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:25:38" (1/1) ... [2024-11-27 20:25:38,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:25:38" (1/1) ... [2024-11-27 20:25:38,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:25:38" (1/1) ... [2024-11-27 20:25:38,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:25:38" (1/1) ... [2024-11-27 20:25:38,873 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:25:38,874 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:25:38,874 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:25:38,878 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:25:38,879 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:25:38" (1/1) ... [2024-11-27 20:25:38,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:25:38,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:25:38,921 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:25:38,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:25:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-27 20:25:38,952 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-27 20:25:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-27 20:25:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-27 20:25:38,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-27 20:25:38,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-27 20:25:38,954 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-27 20:25:38,954 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-27 20:25:38,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 20:25:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-27 20:25:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-27 20:25:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-27 20:25:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 20:25:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-27 20:25:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-27 20:25:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-27 20:25:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-27 20:25:38,955 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-27 20:25:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-27 20:25:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-27 20:25:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-27 20:25:38,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 20:25:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:25:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-27 20:25:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-27 20:25:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-27 20:25:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 20:25:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-27 20:25:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-27 20:25:38,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:25:38,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:25:39,208 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:25:39,211 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:25:39,235 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-27 20:25:39,276 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-27 20:25:39,299 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-27 20:25:41,792 INFO L? ?]: Removed 1042 outVars from TransFormulas that were not future-live. [2024-11-27 20:25:41,792 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:25:41,830 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:25:41,830 INFO L312 CfgBuilder]: Removed 31 assume(true) statements. [2024-11-27 20:25:41,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:25:41 BoogieIcfgContainer [2024-11-27 20:25:41,831 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:25:41,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:25:41,837 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:25:41,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:25:41,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:25:37" (1/3) ... [2024-11-27 20:25:41,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a057cd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:25:41, skipping insertion in model container [2024-11-27 20:25:41,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:25:38" (2/3) ... [2024-11-27 20:25:41,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a057cd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:25:41, skipping insertion in model container [2024-11-27 20:25:41,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:25:41" (3/3) ... [2024-11-27 20:25:41,850 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test2-1.i [2024-11-27 20:25:41,867 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:25:41,869 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test2-1.i that has 6 procedures, 1087 locations, 1 initial locations, 33 loop locations, and 424 error locations. [2024-11-27 20:25:41,937 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:25:41,949 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;@27708335, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:25:41,949 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2024-11-27 20:25:41,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 1077 states, 642 states have (on average 2.0109034267912773) internal successors, (1291), 1070 states have internal predecessors, (1291), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-27 20:25:41,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-27 20:25:41,960 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:25:41,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-27 20:25:41,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:25:41,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:25:41,966 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2024-11-27 20:25:41,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:25:41,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356258442] [2024-11-27 20:25:41,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:25:41,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:25:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:25:42,204 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-27 20:25:42,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:25:42,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356258442] [2024-11-27 20:25:42,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356258442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:25:42,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:25:42,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:25:42,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477971364] [2024-11-27 20:25:42,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:25:42,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:25:42,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:25:42,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:25:42,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:25:42,243 INFO L87 Difference]: Start difference. First operand has 1077 states, 642 states have (on average 2.0109034267912773) internal successors, (1291), 1070 states have internal predecessors, (1291), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) 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-27 20:25:43,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:25:43,213 INFO L93 Difference]: Finished difference Result 1063 states and 1237 transitions. [2024-11-27 20:25:43,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:25:43,216 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-27 20:25:43,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:25:43,237 INFO L225 Difference]: With dead ends: 1063 [2024-11-27 20:25:43,238 INFO L226 Difference]: Without dead ends: 1061 [2024-11-27 20:25:43,239 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-27 20:25:43,243 INFO L435 NwaCegarLoop]: 848 mSDtfsCounter, 1102 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-27 20:25:43,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 900 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-27 20:25:43,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2024-11-27 20:25:43,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1061. [2024-11-27 20:25:43,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 644 states have (on average 1.889751552795031) internal successors, (1217), 1054 states have internal predecessors, (1217), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-27 20:25:43,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1235 transitions. [2024-11-27 20:25:43,339 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1235 transitions. Word has length 3 [2024-11-27 20:25:43,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:25:43,339 INFO L471 AbstractCegarLoop]: Abstraction has 1061 states and 1235 transitions. [2024-11-27 20:25:43,339 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-27 20:25:43,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1235 transitions. [2024-11-27 20:25:43,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-27 20:25:43,339 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:25:43,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-27 20:25:43,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 20:25:43,340 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:25:43,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:25:43,341 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2024-11-27 20:25:43,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:25:43,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977447161] [2024-11-27 20:25:43,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:25:43,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:25:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:25:43,447 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-27 20:25:43,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:25:43,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977447161] [2024-11-27 20:25:43,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977447161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:25:43,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:25:43,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:25:43,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648334135] [2024-11-27 20:25:43,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:25:43,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:25:43,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:25:43,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:25:43,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:25:43,451 INFO L87 Difference]: Start difference. First operand 1061 states and 1235 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-27 20:25:44,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:25:44,680 INFO L93 Difference]: Finished difference Result 1836 states and 2172 transitions. [2024-11-27 20:25:44,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:25:44,680 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-27 20:25:44,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:25:44,688 INFO L225 Difference]: With dead ends: 1836 [2024-11-27 20:25:44,688 INFO L226 Difference]: Without dead ends: 1836 [2024-11-27 20:25:44,688 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-27 20:25:44,689 INFO L435 NwaCegarLoop]: 950 mSDtfsCounter, 919 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 1746 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:25:44,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 1746 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-27 20:25:44,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2024-11-27 20:25:44,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1572. [2024-11-27 20:25:44,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1151 states have (on average 1.8505647263249347) internal successors, (2130), 1563 states have internal predecessors, (2130), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-27 20:25:44,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2162 transitions. [2024-11-27 20:25:44,747 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2162 transitions. Word has length 3 [2024-11-27 20:25:44,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:25:44,747 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2162 transitions. [2024-11-27 20:25:44,747 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-27 20:25:44,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2162 transitions. [2024-11-27 20:25:44,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-27 20:25:44,748 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:25:44,748 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:25:44,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 20:25:44,748 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:25:44,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:25:44,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1743988334, now seen corresponding path program 1 times [2024-11-27 20:25:44,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:25:44,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539201618] [2024-11-27 20:25:44,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:25:44,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:25:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:25:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:25:44,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:25:44,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539201618] [2024-11-27 20:25:44,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539201618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:25:44,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:25:44,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:25:44,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013844146] [2024-11-27 20:25:44,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:25:44,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:25:44,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:25:44,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:25:44,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:25:44,924 INFO L87 Difference]: Start difference. First operand 1572 states and 2162 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-27 20:25:45,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:25:45,708 INFO L93 Difference]: Finished difference Result 1846 states and 2500 transitions. [2024-11-27 20:25:45,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:25:45,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-11-27 20:25:45,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:25:45,716 INFO L225 Difference]: With dead ends: 1846 [2024-11-27 20:25:45,716 INFO L226 Difference]: Without dead ends: 1846 [2024-11-27 20:25:45,716 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-27 20:25:45,717 INFO L435 NwaCegarLoop]: 1178 mSDtfsCounter, 1087 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-27 20:25:45,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 1504 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-27 20:25:45,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2024-11-27 20:25:45,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1525. [2024-11-27 20:25:45,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1151 states have (on average 1.788879235447437) internal successors, (2059), 1516 states have internal predecessors, (2059), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-27 20:25:45,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2091 transitions. [2024-11-27 20:25:45,770 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2091 transitions. Word has length 9 [2024-11-27 20:25:45,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:25:45,770 INFO L471 AbstractCegarLoop]: Abstraction has 1525 states and 2091 transitions. [2024-11-27 20:25:45,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-27 20:25:45,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2091 transitions. [2024-11-27 20:25:45,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-27 20:25:45,771 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:25:45,771 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:25:45,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 20:25:45,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:25:45,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:25:45,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1743988333, now seen corresponding path program 1 times [2024-11-27 20:25:45,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:25:45,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553873896] [2024-11-27 20:25:45,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:25:45,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:25:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:25:45,921 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-27 20:25:45,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:25:45,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553873896] [2024-11-27 20:25:45,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553873896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:25:45,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:25:45,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:25:45,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895814923] [2024-11-27 20:25:45,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:25:45,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:25:45,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:25:45,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:25:45,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:25:45,924 INFO L87 Difference]: Start difference. First operand 1525 states and 2091 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-27 20:25:46,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:25:46,735 INFO L93 Difference]: Finished difference Result 2067 states and 2869 transitions. [2024-11-27 20:25:46,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:25:46,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-11-27 20:25:46,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:25:46,744 INFO L225 Difference]: With dead ends: 2067 [2024-11-27 20:25:46,744 INFO L226 Difference]: Without dead ends: 2067 [2024-11-27 20:25:46,744 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-27 20:25:46,745 INFO L435 NwaCegarLoop]: 1311 mSDtfsCounter, 879 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-27 20:25:46,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 1754 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-27 20:25:46,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2024-11-27 20:25:46,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1500. [2024-11-27 20:25:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1151 states have (on average 1.7463075586446568) internal successors, (2010), 1491 states have internal predecessors, (2010), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-27 20:25:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 2042 transitions. [2024-11-27 20:25:46,793 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 2042 transitions. Word has length 9 [2024-11-27 20:25:46,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:25:46,794 INFO L471 AbstractCegarLoop]: Abstraction has 1500 states and 2042 transitions. [2024-11-27 20:25:46,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-27 20:25:46,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 2042 transitions. [2024-11-27 20:25:46,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-27 20:25:46,794 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:25:46,794 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:25:46,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 20:25:46,795 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr422ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:25:46,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:25:46,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1246154765, now seen corresponding path program 1 times [2024-11-27 20:25:46,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:25:46,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742738061] [2024-11-27 20:25:46,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:25:46,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:25:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:25:46,969 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-27 20:25:46,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:25:46,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742738061] [2024-11-27 20:25:46,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742738061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:25:46,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:25:46,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:25:46,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638756822] [2024-11-27 20:25:46,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:25:46,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:25:46,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:25:46,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:25:46,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:25:46,971 INFO L87 Difference]: Start difference. First operand 1500 states and 2042 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-27 20:25:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:25:47,225 INFO L93 Difference]: Finished difference Result 2685 states and 3581 transitions. [2024-11-27 20:25:47,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:25:47,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-11-27 20:25:47,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:25:47,238 INFO L225 Difference]: With dead ends: 2685 [2024-11-27 20:25:47,238 INFO L226 Difference]: Without dead ends: 2685 [2024-11-27 20:25:47,238 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-27 20:25:47,239 INFO L435 NwaCegarLoop]: 1110 mSDtfsCounter, 1101 mSDsluCounter, 2201 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 3311 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:25:47,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 3311 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:25:47,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2024-11-27 20:25:47,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 1502. [2024-11-27 20:25:47,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1153 states have (on average 1.7450130095403296) internal successors, (2012), 1493 states have internal predecessors, (2012), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-27 20:25:47,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 2044 transitions. [2024-11-27 20:25:47,291 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 2044 transitions. Word has length 10 [2024-11-27 20:25:47,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:25:47,294 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 2044 transitions. [2024-11-27 20:25:47,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-27 20:25:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 2044 transitions. [2024-11-27 20:25:47,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-27 20:25:47,295 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:25:47,295 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:25:47,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 20:25:47,295 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:25:47,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:25:47,295 INFO L85 PathProgramCache]: Analyzing trace with hash 495195041, now seen corresponding path program 1 times [2024-11-27 20:25:47,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:25:47,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037662713] [2024-11-27 20:25:47,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:25:47,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:25:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:25:47,426 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-27 20:25:47,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:25:47,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037662713] [2024-11-27 20:25:47,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037662713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:25:47,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:25:47,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:25:47,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671837243] [2024-11-27 20:25:47,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:25:47,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:25:47,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:25:47,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:25:47,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:25:47,429 INFO L87 Difference]: Start difference. First operand 1502 states and 2044 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-27 20:25:48,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:25:48,314 INFO L93 Difference]: Finished difference Result 1578 states and 2151 transitions. [2024-11-27 20:25:48,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:25:48,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-27 20:25:48,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:25:48,321 INFO L225 Difference]: With dead ends: 1578 [2024-11-27 20:25:48,321 INFO L226 Difference]: Without dead ends: 1578 [2024-11-27 20:25:48,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:25:48,322 INFO L435 NwaCegarLoop]: 750 mSDtfsCounter, 1352 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-27 20:25:48,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 1363 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-27 20:25:48,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2024-11-27 20:25:48,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1479. [2024-11-27 20:25:48,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1153 states have (on average 1.705117085862966) internal successors, (1966), 1470 states have internal predecessors, (1966), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-27 20:25:48,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 1998 transitions. [2024-11-27 20:25:48,366 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 1998 transitions. Word has length 19 [2024-11-27 20:25:48,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:25:48,366 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 1998 transitions. [2024-11-27 20:25:48,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-27 20:25:48,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 1998 transitions. [2024-11-27 20:25:48,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-27 20:25:48,367 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:25:48,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:25:48,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 20:25:48,368 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:25:48,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:25:48,369 INFO L85 PathProgramCache]: Analyzing trace with hash 495195042, now seen corresponding path program 1 times [2024-11-27 20:25:48,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:25:48,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161373781] [2024-11-27 20:25:48,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:25:48,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:25:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:25:48,458 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-27 20:25:48,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:25:48,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161373781] [2024-11-27 20:25:48,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161373781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:25:48,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:25:48,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:25:48,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207780717] [2024-11-27 20:25:48,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:25:48,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:25:48,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:25:48,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:25:48,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:25:48,460 INFO L87 Difference]: Start difference. First operand 1479 states and 1998 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-27 20:25:48,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:25:48,494 INFO L93 Difference]: Finished difference Result 1341 states and 1792 transitions. [2024-11-27 20:25:48,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:25:48,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-27 20:25:48,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:25:48,500 INFO L225 Difference]: With dead ends: 1341 [2024-11-27 20:25:48,500 INFO L226 Difference]: Without dead ends: 1341 [2024-11-27 20:25:48,500 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-27 20:25:48,501 INFO L435 NwaCegarLoop]: 1015 mSDtfsCounter, 61 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1977 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:25:48,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1977 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:25:48,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2024-11-27 20:25:48,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1341. [2024-11-27 20:25:48,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 1027 states have (on average 1.7137293086660175) internal successors, (1760), 1332 states have internal predecessors, (1760), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-27 20:25:48,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1792 transitions. [2024-11-27 20:25:48,535 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1792 transitions. Word has length 19 [2024-11-27 20:25:48,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:25:48,536 INFO L471 AbstractCegarLoop]: Abstraction has 1341 states and 1792 transitions. [2024-11-27 20:25:48,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-27 20:25:48,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1792 transitions. [2024-11-27 20:25:48,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-27 20:25:48,536 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:25:48,536 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:25:48,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 20:25:48,537 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:25:48,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:25:48,537 INFO L85 PathProgramCache]: Analyzing trace with hash -858657125, now seen corresponding path program 1 times [2024-11-27 20:25:48,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:25:48,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827501991] [2024-11-27 20:25:48,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:25:48,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:25:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:25:48,651 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-27 20:25:48,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:25:48,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827501991] [2024-11-27 20:25:48,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827501991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:25:48,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:25:48,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:25:48,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304516750] [2024-11-27 20:25:48,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:25:48,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:25:48,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:25:48,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:25:48,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:25:48,653 INFO L87 Difference]: Start difference. First operand 1341 states and 1792 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-27 20:25:48,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:25:48,749 INFO L93 Difference]: Finished difference Result 1312 states and 1742 transitions. [2024-11-27 20:25:48,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:25:48,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2024-11-27 20:25:48,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:25:48,754 INFO L225 Difference]: With dead ends: 1312 [2024-11-27 20:25:48,754 INFO L226 Difference]: Without dead ends: 1312 [2024-11-27 20:25:48,755 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-27 20:25:48,755 INFO L435 NwaCegarLoop]: 980 mSDtfsCounter, 41 mSDsluCounter, 1932 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2912 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:25:48,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2912 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:25:48,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2024-11-27 20:25:48,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1306. [2024-11-27 20:25:48,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 999 states have (on average 1.7057057057057057) internal successors, (1704), 1297 states have internal predecessors, (1704), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-27 20:25:48,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1736 transitions. [2024-11-27 20:25:48,783 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1736 transitions. Word has length 21 [2024-11-27 20:25:48,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:25:48,783 INFO L471 AbstractCegarLoop]: Abstraction has 1306 states and 1736 transitions. [2024-11-27 20:25:48,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-27 20:25:48,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1736 transitions. [2024-11-27 20:25:48,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-27 20:25:48,784 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:25:48,784 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:25:48,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 20:25:48,785 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:25:48,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:25:48,785 INFO L85 PathProgramCache]: Analyzing trace with hash -496287351, now seen corresponding path program 1 times [2024-11-27 20:25:48,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:25:48,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884583945] [2024-11-27 20:25:48,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:25:48,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:25:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:25:49,037 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-27 20:25:49,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:25:49,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884583945] [2024-11-27 20:25:49,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884583945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:25:49,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:25:49,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:25:49,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774774840] [2024-11-27 20:25:49,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:25:49,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:25:49,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:25:49,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:25:49,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:25:49,039 INFO L87 Difference]: Start difference. First operand 1306 states and 1736 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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-27 20:25:50,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:25:50,079 INFO L93 Difference]: Finished difference Result 2102 states and 2887 transitions. [2024-11-27 20:25:50,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:25:50,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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 35 [2024-11-27 20:25:50,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:25:50,087 INFO L225 Difference]: With dead ends: 2102 [2024-11-27 20:25:50,087 INFO L226 Difference]: Without dead ends: 2102 [2024-11-27 20:25:50,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:25:50,089 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 828 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:25:50,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1926 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-27 20:25:50,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2024-11-27 20:25:50,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 1302. [2024-11-27 20:25:50,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 999 states have (on average 1.6976976976976976) internal successors, (1696), 1293 states have internal predecessors, (1696), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-27 20:25:50,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1728 transitions. [2024-11-27 20:25:50,130 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1728 transitions. Word has length 35 [2024-11-27 20:25:50,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:25:50,131 INFO L471 AbstractCegarLoop]: Abstraction has 1302 states and 1728 transitions. [2024-11-27 20:25:50,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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-27 20:25:50,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1728 transitions. [2024-11-27 20:25:50,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-27 20:25:50,136 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:25:50,136 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:25:50,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 20:25:50,137 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:25:50,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:25:50,137 INFO L85 PathProgramCache]: Analyzing trace with hash -907140769, now seen corresponding path program 1 times [2024-11-27 20:25:50,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:25:50,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292993637] [2024-11-27 20:25:50,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:25:50,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:25:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:25:50,325 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-27 20:25:50,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:25:50,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292993637] [2024-11-27 20:25:50,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292993637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:25:50,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:25:50,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:25:50,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921468496] [2024-11-27 20:25:50,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:25:50,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:25:50,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:25:50,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:25:50,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:25:50,326 INFO L87 Difference]: Start difference. First operand 1302 states and 1728 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-27 20:25:50,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:25:50,389 INFO L93 Difference]: Finished difference Result 1302 states and 1720 transitions. [2024-11-27 20:25:50,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:25:50,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 69 [2024-11-27 20:25:50,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:25:50,396 INFO L225 Difference]: With dead ends: 1302 [2024-11-27 20:25:50,396 INFO L226 Difference]: Without dead ends: 1302 [2024-11-27 20:25:50,396 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-27 20:25:50,397 INFO L435 NwaCegarLoop]: 975 mSDtfsCounter, 21 mSDsluCounter, 1919 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2894 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:25:50,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2894 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:25:50,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2024-11-27 20:25:50,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1302. [2024-11-27 20:25:50,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 999 states have (on average 1.6896896896896898) internal successors, (1688), 1293 states have internal predecessors, (1688), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-27 20:25:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1720 transitions. [2024-11-27 20:25:50,432 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1720 transitions. Word has length 69 [2024-11-27 20:25:50,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:25:50,432 INFO L471 AbstractCegarLoop]: Abstraction has 1302 states and 1720 transitions. [2024-11-27 20:25:50,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-27 20:25:50,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1720 transitions. [2024-11-27 20:25:50,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-27 20:25:50,436 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:25:50,436 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:25:50,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 20:25:50,436 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:25:50,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:25:50,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1031867989, now seen corresponding path program 1 times [2024-11-27 20:25:50,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:25:50,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089149773] [2024-11-27 20:25:50,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:25:50,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:25:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:25:50,687 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-27 20:25:50,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:25:50,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089149773] [2024-11-27 20:25:50,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089149773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:25:50,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:25:50,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:25:50,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439968349] [2024-11-27 20:25:50,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:25:50,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:25:50,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:25:50,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:25:50,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:25:50,688 INFO L87 Difference]: Start difference. First operand 1302 states and 1720 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:25:50,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:25:50,768 INFO L93 Difference]: Finished difference Result 1833 states and 2483 transitions. [2024-11-27 20:25:50,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:25:50,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-27 20:25:50,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:25:50,777 INFO L225 Difference]: With dead ends: 1833 [2024-11-27 20:25:50,777 INFO L226 Difference]: Without dead ends: 1833 [2024-11-27 20:25:50,777 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-27 20:25:50,778 INFO L435 NwaCegarLoop]: 1272 mSDtfsCounter, 364 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 2217 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:25:50,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 2217 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:25:50,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2024-11-27 20:25:50,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1776. [2024-11-27 20:25:50,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1463 states have (on average 1.6596035543403964) internal successors, (2428), 1767 states have internal predecessors, (2428), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-27 20:25:50,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2480 transitions. [2024-11-27 20:25:50,818 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2480 transitions. Word has length 77 [2024-11-27 20:25:50,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:25:50,818 INFO L471 AbstractCegarLoop]: Abstraction has 1776 states and 2480 transitions. [2024-11-27 20:25:50,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:25:50,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2480 transitions. [2024-11-27 20:25:50,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-27 20:25:50,820 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:25:50,820 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:25:50,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 20:25:50,820 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:25:50,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:25:50,821 INFO L85 PathProgramCache]: Analyzing trace with hash 646450878, now seen corresponding path program 1 times [2024-11-27 20:25:50,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:25:50,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586098224] [2024-11-27 20:25:50,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:25:50,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:25:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:25:51,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:25:51,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:25:51,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586098224] [2024-11-27 20:25:51,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586098224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:25:51,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:25:51,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:25:51,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005792130] [2024-11-27 20:25:51,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:25:51,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:25:51,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:25:51,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:25:51,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:25:51,308 INFO L87 Difference]: Start difference. First operand 1776 states and 2480 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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-27 20:25:52,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:25:52,196 INFO L93 Difference]: Finished difference Result 1775 states and 2478 transitions. [2024-11-27 20:25:52,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:25:52,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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 85 [2024-11-27 20:25:52,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:25:52,203 INFO L225 Difference]: With dead ends: 1775 [2024-11-27 20:25:52,203 INFO L226 Difference]: Without dead ends: 1775 [2024-11-27 20:25:52,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:25:52,204 INFO L435 NwaCegarLoop]: 986 mSDtfsCounter, 2 mSDsluCounter, 1967 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2953 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-27 20:25:52,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2953 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-27 20:25:52,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2024-11-27 20:25:52,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1775. [2024-11-27 20:25:52,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1463 states have (on average 1.6582365003417634) internal successors, (2426), 1766 states have internal predecessors, (2426), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-27 20:25:52,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2478 transitions. [2024-11-27 20:25:52,263 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2478 transitions. Word has length 85 [2024-11-27 20:25:52,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:25:52,264 INFO L471 AbstractCegarLoop]: Abstraction has 1775 states and 2478 transitions. [2024-11-27 20:25:52,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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-27 20:25:52,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2478 transitions. [2024-11-27 20:25:52,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-27 20:25:52,266 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:25:52,267 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:25:52,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 20:25:52,267 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:25:52,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:25:52,268 INFO L85 PathProgramCache]: Analyzing trace with hash 646450879, now seen corresponding path program 1 times [2024-11-27 20:25:52,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:25:52,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38603888] [2024-11-27 20:25:52,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:25:52,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:25:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:25:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:25:52,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:25:52,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38603888] [2024-11-27 20:25:52,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38603888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:25:52,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:25:52,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:25:52,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116419411] [2024-11-27 20:25:52,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:25:52,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:25:52,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:25:52,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:25:52,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:25:52,985 INFO L87 Difference]: Start difference. First operand 1775 states and 2478 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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-27 20:25:54,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:25:54,048 INFO L93 Difference]: Finished difference Result 1774 states and 2476 transitions. [2024-11-27 20:25:54,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:25:54,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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 85 [2024-11-27 20:25:54,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:25:54,053 INFO L225 Difference]: With dead ends: 1774 [2024-11-27 20:25:54,053 INFO L226 Difference]: Without dead ends: 1774 [2024-11-27 20:25:54,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:25:54,054 INFO L435 NwaCegarLoop]: 986 mSDtfsCounter, 1 mSDsluCounter, 1905 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2891 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:25:54,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2891 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-27 20:25:54,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2024-11-27 20:25:54,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1774. [2024-11-27 20:25:54,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1774 states, 1461 states have (on average 1.6591375770020533) internal successors, (2424), 1765 states have internal predecessors, (2424), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-27 20:25:54,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 2476 transitions. [2024-11-27 20:25:54,104 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 2476 transitions. Word has length 85 [2024-11-27 20:25:54,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:25:54,105 INFO L471 AbstractCegarLoop]: Abstraction has 1774 states and 2476 transitions. [2024-11-27 20:25:54,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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-27 20:25:54,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 2476 transitions. [2024-11-27 20:25:54,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-27 20:25:54,106 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:25:54,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:25:54,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 20:25:54,106 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:25:54,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:25:54,107 INFO L85 PathProgramCache]: Analyzing trace with hash -333056507, now seen corresponding path program 1 times [2024-11-27 20:25:54,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:25:54,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965078670] [2024-11-27 20:25:54,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:25:54,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:25:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:25:54,461 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-27 20:25:54,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:25:54,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965078670] [2024-11-27 20:25:54,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965078670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:25:54,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:25:54,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:25:54,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600429582] [2024-11-27 20:25:54,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:25:54,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:25:54,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:25:54,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:25:54,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:25:54,463 INFO L87 Difference]: Start difference. First operand 1774 states and 2476 transitions. Second operand has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:25:55,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:25:55,676 INFO L93 Difference]: Finished difference Result 1792 states and 2502 transitions. [2024-11-27 20:25:55,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:25:55,676 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-27 20:25:55,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:25:55,688 INFO L225 Difference]: With dead ends: 1792 [2024-11-27 20:25:55,690 INFO L226 Difference]: Without dead ends: 1792 [2024-11-27 20:25:55,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:25:55,691 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 13 mSDsluCounter, 3594 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4565 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:25:55,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4565 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-27 20:25:55,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2024-11-27 20:25:55,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1783. [2024-11-27 20:25:55,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1469 states have (on average 1.6575901974132063) internal successors, (2435), 1772 states have internal predecessors, (2435), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (30), 11 states have call predecessors, (30), 25 states have call successors, (30) [2024-11-27 20:25:55,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2492 transitions. [2024-11-27 20:25:55,736 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2492 transitions. Word has length 93 [2024-11-27 20:25:55,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:25:55,736 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2492 transitions. [2024-11-27 20:25:55,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:25:55,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2492 transitions. [2024-11-27 20:25:55,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-27 20:25:55,737 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:25:55,737 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:25:55,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 20:25:55,738 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:25:55,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:25:55,738 INFO L85 PathProgramCache]: Analyzing trace with hash -333056506, now seen corresponding path program 1 times [2024-11-27 20:25:55,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:25:55,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842328096] [2024-11-27 20:25:55,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:25:55,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:25:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:25:56,536 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-27 20:25:56,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:25:56,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842328096] [2024-11-27 20:25:56,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842328096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:25:56,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:25:56,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:25:56,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599623433] [2024-11-27 20:25:56,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:25:56,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:25:56,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:25:56,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:25:56,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:25:56,538 INFO L87 Difference]: Start difference. First operand 1783 states and 2492 transitions. Second operand has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:25:57,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:25:57,789 INFO L93 Difference]: Finished difference Result 1783 states and 2490 transitions. [2024-11-27 20:25:57,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:25:57,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-27 20:25:57,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:25:57,799 INFO L225 Difference]: With dead ends: 1783 [2024-11-27 20:25:57,803 INFO L226 Difference]: Without dead ends: 1783 [2024-11-27 20:25:57,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:25:57,804 INFO L435 NwaCegarLoop]: 975 mSDtfsCounter, 8 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3692 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:25:57,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3692 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1229 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-27 20:25:57,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2024-11-27 20:25:57,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1783. [2024-11-27 20:25:57,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1469 states have (on average 1.6562287270251872) internal successors, (2433), 1772 states have internal predecessors, (2433), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (30), 11 states have call predecessors, (30), 25 states have call successors, (30) [2024-11-27 20:25:57,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2490 transitions. [2024-11-27 20:25:57,839 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2490 transitions. Word has length 93 [2024-11-27 20:25:57,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:25:57,839 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2490 transitions. [2024-11-27 20:25:57,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:25:57,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2490 transitions. [2024-11-27 20:25:57,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-27 20:25:57,841 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:25:57,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:25:57,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-27 20:25:57,841 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:25:57,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:25:57,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1189047585, now seen corresponding path program 1 times [2024-11-27 20:25:57,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:25:57,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845257346] [2024-11-27 20:25:57,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:25:57,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:25:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:25:58,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:25:58,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:25:58,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845257346] [2024-11-27 20:25:58,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845257346] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:25:58,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207275983] [2024-11-27 20:25:58,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:25:58,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:25:58,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:25:58,510 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:25:58,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:25:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:25:58,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-27 20:25:58,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:25:58,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:25:59,065 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 20:25:59,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-27 20:25:59,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:25:59,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-27 20:25:59,496 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:25:59,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-27 20:25:59,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-27 20:25:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:25:59,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:25:59,653 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-27 20:25:59,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207275983] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:25:59,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:25:59,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-27 20:25:59,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995717546] [2024-11-27 20:25:59,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:25:59,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-27 20:25:59,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:25:59,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-27 20:25:59,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2024-11-27 20:25:59,659 INFO L87 Difference]: Start difference. First operand 1783 states and 2490 transitions. Second operand has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:26:02,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:02,810 INFO L93 Difference]: Finished difference Result 1790 states and 2496 transitions. [2024-11-27 20:26:02,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 20:26:02,812 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2024-11-27 20:26:02,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:02,822 INFO L225 Difference]: With dead ends: 1790 [2024-11-27 20:26:02,822 INFO L226 Difference]: Without dead ends: 1790 [2024-11-27 20:26:02,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=427, Unknown=1, NotChecked=42, Total=552 [2024-11-27 20:26:02,823 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 890 mSDsluCounter, 6182 mSDsCounter, 0 mSdLazyCounter, 4050 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 6821 SdHoareTripleChecker+Invalid, 4072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:02,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 6821 Invalid, 4072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 4050 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-27 20:26:02,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2024-11-27 20:26:02,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1787. [2024-11-27 20:26:02,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1787 states, 1473 states have (on average 1.6537678207739308) internal successors, (2436), 1775 states have internal predecessors, (2436), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-27 20:26:02,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 2490 transitions. [2024-11-27 20:26:02,858 INFO L78 Accepts]: Start accepts. Automaton has 1787 states and 2490 transitions. Word has length 94 [2024-11-27 20:26:02,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:02,858 INFO L471 AbstractCegarLoop]: Abstraction has 1787 states and 2490 transitions. [2024-11-27 20:26:02,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:26:02,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2490 transitions. [2024-11-27 20:26:02,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-27 20:26:02,859 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:02,859 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:26:02,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 20:26:03,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-27 20:26:03,065 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:26:03,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:03,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1189047584, now seen corresponding path program 1 times [2024-11-27 20:26:03,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:03,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321873191] [2024-11-27 20:26:03,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:03,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:04,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:04,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:04,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321873191] [2024-11-27 20:26:04,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321873191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:26:04,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700404298] [2024-11-27 20:26:04,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:04,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:26:04,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:26:04,007 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:26:04,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:26:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:04,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-27 20:26:04,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:26:04,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:26:04,419 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 20:26:04,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-27 20:26:04,426 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-27 20:26:04,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:26:04,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:26:04,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-27 20:26:04,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:26:04,651 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:26:04,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:26:04,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:26:04,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-27 20:26:04,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:26:04,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:04,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:26:04,853 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_731 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-27 20:26:04,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700404298] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:26:04,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:26:04,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2024-11-27 20:26:04,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785391124] [2024-11-27 20:26:04,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:26:04,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-27 20:26:04,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:04,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-27 20:26:04,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2024-11-27 20:26:04,858 INFO L87 Difference]: Start difference. First operand 1787 states and 2490 transitions. Second operand has 15 states, 12 states have (on average 11.833333333333334) internal successors, (142), 15 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:26:06,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:06,762 INFO L93 Difference]: Finished difference Result 1789 states and 2494 transitions. [2024-11-27 20:26:06,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 20:26:06,763 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 11.833333333333334) internal successors, (142), 15 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2024-11-27 20:26:06,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:06,773 INFO L225 Difference]: With dead ends: 1789 [2024-11-27 20:26:06,773 INFO L226 Difference]: Without dead ends: 1789 [2024-11-27 20:26:06,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2024-11-27 20:26:06,774 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 889 mSDsluCounter, 2708 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 3350 SdHoareTripleChecker+Invalid, 2661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:06,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 3350 Invalid, 2661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2630 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-27 20:26:06,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2024-11-27 20:26:06,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1777. [2024-11-27 20:26:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1465 states have (on average 1.6552901023890785) internal successors, (2425), 1767 states have internal predecessors, (2425), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-27 20:26:06,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2477 transitions. [2024-11-27 20:26:06,805 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2477 transitions. Word has length 94 [2024-11-27 20:26:06,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:06,805 INFO L471 AbstractCegarLoop]: Abstraction has 1777 states and 2477 transitions. [2024-11-27 20:26:06,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 11.833333333333334) internal successors, (142), 15 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:26:06,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2477 transitions. [2024-11-27 20:26:06,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-27 20:26:06,806 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:06,806 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:26:06,820 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-27 20:26:07,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-27 20:26:07,007 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:26:07,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:07,007 INFO L85 PathProgramCache]: Analyzing trace with hash -711299799, now seen corresponding path program 1 times [2024-11-27 20:26:07,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:07,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759780008] [2024-11-27 20:26:07,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:07,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:07,741 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-27 20:26:07,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:07,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759780008] [2024-11-27 20:26:07,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759780008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:07,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:07,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-27 20:26:07,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423597441] [2024-11-27 20:26:07,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:07,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-27 20:26:07,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:07,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-27 20:26:07,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-27 20:26:07,744 INFO L87 Difference]: Start difference. First operand 1777 states and 2477 transitions. Second operand has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:26:10,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:10,423 INFO L93 Difference]: Finished difference Result 1796 states and 2502 transitions. [2024-11-27 20:26:10,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-27 20:26:10,424 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2024-11-27 20:26:10,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:10,427 INFO L225 Difference]: With dead ends: 1796 [2024-11-27 20:26:10,427 INFO L226 Difference]: Without dead ends: 1796 [2024-11-27 20:26:10,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-27 20:26:10,428 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 896 mSDsluCounter, 6774 mSDsCounter, 0 mSdLazyCounter, 4433 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 7413 SdHoareTripleChecker+Invalid, 4451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:10,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 7413 Invalid, 4451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4433 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-27 20:26:10,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2024-11-27 20:26:10,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1792. [2024-11-27 20:26:10,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1479 states have (on average 1.6511156186612577) internal successors, (2442), 1780 states have internal predecessors, (2442), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-27 20:26:10,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2496 transitions. [2024-11-27 20:26:10,471 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2496 transitions. Word has length 96 [2024-11-27 20:26:10,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:10,471 INFO L471 AbstractCegarLoop]: Abstraction has 1792 states and 2496 transitions. [2024-11-27 20:26:10,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:26:10,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2496 transitions. [2024-11-27 20:26:10,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-27 20:26:10,472 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:10,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:26:10,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-27 20:26:10,473 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:26:10,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:10,473 INFO L85 PathProgramCache]: Analyzing trace with hash -711299798, now seen corresponding path program 1 times [2024-11-27 20:26:10,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:10,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395528639] [2024-11-27 20:26:10,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:10,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:11,299 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-27 20:26:11,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:11,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395528639] [2024-11-27 20:26:11,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395528639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:11,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:11,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-27 20:26:11,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226442857] [2024-11-27 20:26:11,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:11,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 20:26:11,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:11,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 20:26:11,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:26:11,301 INFO L87 Difference]: Start difference. First operand 1792 states and 2496 transitions. Second operand has 11 states, 10 states have (on average 9.4) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:26:13,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:13,658 INFO L93 Difference]: Finished difference Result 1795 states and 2500 transitions. [2024-11-27 20:26:13,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:26:13,659 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.4) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2024-11-27 20:26:13,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:13,664 INFO L225 Difference]: With dead ends: 1795 [2024-11-27 20:26:13,664 INFO L226 Difference]: Without dead ends: 1795 [2024-11-27 20:26:13,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-27 20:26:13,665 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 912 mSDsluCounter, 3782 mSDsCounter, 0 mSdLazyCounter, 3416 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 4425 SdHoareTripleChecker+Invalid, 3433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:13,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 4425 Invalid, 3433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3416 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-27 20:26:13,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2024-11-27 20:26:13,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1792. [2024-11-27 20:26:13,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1479 states have (on average 1.649763353617309) internal successors, (2440), 1780 states have internal predecessors, (2440), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-27 20:26:13,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2494 transitions. [2024-11-27 20:26:13,691 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2494 transitions. Word has length 96 [2024-11-27 20:26:13,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:13,691 INFO L471 AbstractCegarLoop]: Abstraction has 1792 states and 2494 transitions. [2024-11-27 20:26:13,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.4) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:26:13,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2494 transitions. [2024-11-27 20:26:13,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-27 20:26:13,692 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:13,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:26:13,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-27 20:26:13,693 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:26:13,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:13,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1974299151, now seen corresponding path program 1 times [2024-11-27 20:26:13,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:13,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006723092] [2024-11-27 20:26:13,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:13,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:14,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:14,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:14,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006723092] [2024-11-27 20:26:14,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006723092] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:26:14,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63940263] [2024-11-27 20:26:14,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:14,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:26:14,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:26:14,335 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:26:14,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 20:26:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:14,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-27 20:26:14,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:26:14,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:26:14,799 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 20:26:14,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-27 20:26:14,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:26:14,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-27 20:26:15,164 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:26:15,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-27 20:26:15,273 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:26:15,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-27 20:26:15,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-27 20:26:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:15,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:26:15,461 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1015))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1012)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-27 20:26:15,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63940263] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:26:15,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:26:15,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-27 20:26:15,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112399002] [2024-11-27 20:26:15,463 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:26:15,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-27 20:26:15,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:15,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-27 20:26:15,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=465, Unknown=9, NotChecked=44, Total=600 [2024-11-27 20:26:15,465 INFO L87 Difference]: Start difference. First operand 1792 states and 2494 transitions. Second operand has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:26:18,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:18,374 INFO L93 Difference]: Finished difference Result 1794 states and 2498 transitions. [2024-11-27 20:26:18,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 20:26:18,375 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2024-11-27 20:26:18,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:18,378 INFO L225 Difference]: With dead ends: 1794 [2024-11-27 20:26:18,378 INFO L226 Difference]: Without dead ends: 1794 [2024-11-27 20:26:18,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=593, Unknown=9, NotChecked=50, Total=756 [2024-11-27 20:26:18,379 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 875 mSDsluCounter, 6173 mSDsCounter, 0 mSdLazyCounter, 4075 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 6811 SdHoareTripleChecker+Invalid, 4096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:18,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 6811 Invalid, 4096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4075 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-27 20:26:18,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2024-11-27 20:26:18,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1791. [2024-11-27 20:26:18,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1479 states have (on average 1.6484110885733603) internal successors, (2438), 1779 states have internal predecessors, (2438), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-27 20:26:18,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2492 transitions. [2024-11-27 20:26:18,404 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2492 transitions. Word has length 97 [2024-11-27 20:26:18,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:18,404 INFO L471 AbstractCegarLoop]: Abstraction has 1791 states and 2492 transitions. [2024-11-27 20:26:18,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:26:18,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2492 transitions. [2024-11-27 20:26:18,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-27 20:26:18,405 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:18,406 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:26:18,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-27 20:26:18,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:26:18,610 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:26:18,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:18,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1974299152, now seen corresponding path program 1 times [2024-11-27 20:26:18,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:18,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49466047] [2024-11-27 20:26:18,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:18,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:19,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:19,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:19,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49466047] [2024-11-27 20:26:19,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49466047] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:26:19,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757955203] [2024-11-27 20:26:19,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:19,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:26:19,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:26:19,556 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:26:19,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 20:26:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:19,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-27 20:26:19,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:26:19,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:26:20,002 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-27 20:26:20,012 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 20:26:20,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-27 20:26:20,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:26:20,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:26:20,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-27 20:26:20,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:26:20,317 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:26:20,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:26:20,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:26:20,423 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:26:20,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:26:20,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:26:20,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-27 20:26:20,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:26:20,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:20,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:26:20,562 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1167 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1167 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))))) is different from false [2024-11-27 20:26:20,577 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1167 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1167 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-27 20:26:20,640 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1173) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1174))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1173) .cse1 v_ArrVal_1167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-27 20:26:20,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757955203] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:26:20,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:26:20,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-11-27 20:26:20,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074454900] [2024-11-27 20:26:20,643 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:26:20,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-27 20:26:20,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:20,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-27 20:26:20,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=398, Unknown=3, NotChecked=126, Total=600 [2024-11-27 20:26:20,645 INFO L87 Difference]: Start difference. First operand 1791 states and 2492 transitions. Second operand has 20 states, 17 states have (on average 9.058823529411764) internal successors, (154), 20 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:26:24,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:24,031 INFO L93 Difference]: Finished difference Result 1793 states and 2496 transitions. [2024-11-27 20:26:24,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-27 20:26:24,032 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 9.058823529411764) internal successors, (154), 20 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2024-11-27 20:26:24,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:24,036 INFO L225 Difference]: With dead ends: 1793 [2024-11-27 20:26:24,036 INFO L226 Difference]: Without dead ends: 1793 [2024-11-27 20:26:24,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=595, Unknown=3, NotChecked=156, Total=870 [2024-11-27 20:26:24,037 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 887 mSDsluCounter, 5246 mSDsCounter, 0 mSdLazyCounter, 4907 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 5887 SdHoareTripleChecker+Invalid, 4938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:24,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 5887 Invalid, 4938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 4907 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-27 20:26:24,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2024-11-27 20:26:24,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1775. [2024-11-27 20:26:24,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1465 states have (on average 1.6525597269624572) internal successors, (2421), 1765 states have internal predecessors, (2421), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-27 20:26:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2473 transitions. [2024-11-27 20:26:24,061 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2473 transitions. Word has length 97 [2024-11-27 20:26:24,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:24,061 INFO L471 AbstractCegarLoop]: Abstraction has 1775 states and 2473 transitions. [2024-11-27 20:26:24,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 9.058823529411764) internal successors, (154), 20 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:26:24,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2473 transitions. [2024-11-27 20:26:24,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-27 20:26:24,062 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:24,062 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:26:24,072 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-27 20:26:24,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-27 20:26:24,263 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:26:24,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:24,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1036979884, now seen corresponding path program 1 times [2024-11-27 20:26:24,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:24,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134776244] [2024-11-27 20:26:24,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:24,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:24,915 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-27 20:26:24,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:24,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134776244] [2024-11-27 20:26:24,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134776244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:24,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:24,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-27 20:26:24,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076564046] [2024-11-27 20:26:24,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:24,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-27 20:26:24,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:24,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-27 20:26:24,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-27 20:26:24,917 INFO L87 Difference]: Start difference. First operand 1775 states and 2473 transitions. Second operand has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:26:26,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:26,789 INFO L93 Difference]: Finished difference Result 1800 states and 2504 transitions. [2024-11-27 20:26:26,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 20:26:26,790 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-27 20:26:26,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:26,794 INFO L225 Difference]: With dead ends: 1800 [2024-11-27 20:26:26,795 INFO L226 Difference]: Without dead ends: 1800 [2024-11-27 20:26:26,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-27 20:26:26,796 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 921 mSDsluCounter, 4330 mSDsCounter, 0 mSdLazyCounter, 2964 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 4968 SdHoareTripleChecker+Invalid, 2983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:26,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 4968 Invalid, 2983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2964 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-27 20:26:26,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states. [2024-11-27 20:26:26,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 1796. [2024-11-27 20:26:26,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 1485 states have (on average 1.6457912457912458) internal successors, (2444), 1784 states have internal predecessors, (2444), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-27 20:26:26,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2498 transitions. [2024-11-27 20:26:26,821 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2498 transitions. Word has length 99 [2024-11-27 20:26:26,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:26,821 INFO L471 AbstractCegarLoop]: Abstraction has 1796 states and 2498 transitions. [2024-11-27 20:26:26,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:26:26,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2498 transitions. [2024-11-27 20:26:26,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-27 20:26:26,822 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:26,822 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:26:26,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-27 20:26:26,823 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:26:26,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:26,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1036979885, now seen corresponding path program 1 times [2024-11-27 20:26:26,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:26,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480421018] [2024-11-27 20:26:26,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:26,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:27,670 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-27 20:26:27,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:27,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480421018] [2024-11-27 20:26:27,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480421018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:27,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:27,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-27 20:26:27,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745210158] [2024-11-27 20:26:27,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:27,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 20:26:27,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:27,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 20:26:27,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:26:27,673 INFO L87 Difference]: Start difference. First operand 1796 states and 2498 transitions. Second operand has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 12 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:26:29,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:29,929 INFO L93 Difference]: Finished difference Result 1799 states and 2502 transitions. [2024-11-27 20:26:29,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 20:26:29,930 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 12 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-27 20:26:29,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:29,935 INFO L225 Difference]: With dead ends: 1799 [2024-11-27 20:26:29,935 INFO L226 Difference]: Without dead ends: 1799 [2024-11-27 20:26:29,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-27 20:26:29,936 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 895 mSDsluCounter, 3199 mSDsCounter, 0 mSdLazyCounter, 3095 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 3841 SdHoareTripleChecker+Invalid, 3112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:29,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 3841 Invalid, 3112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3095 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-27 20:26:29,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2024-11-27 20:26:29,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1796. [2024-11-27 20:26:29,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 1485 states have (on average 1.6444444444444444) internal successors, (2442), 1784 states have internal predecessors, (2442), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-27 20:26:29,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2496 transitions. [2024-11-27 20:26:29,959 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2496 transitions. Word has length 99 [2024-11-27 20:26:29,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:29,959 INFO L471 AbstractCegarLoop]: Abstraction has 1796 states and 2496 transitions. [2024-11-27 20:26:29,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 12 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:26:29,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2496 transitions. [2024-11-27 20:26:29,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-27 20:26:29,961 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:29,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:26:29,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-27 20:26:29,961 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:26:29,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:29,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1064509446, now seen corresponding path program 1 times [2024-11-27 20:26:29,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:29,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310874087] [2024-11-27 20:26:29,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:29,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:30,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:30,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:30,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310874087] [2024-11-27 20:26:30,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310874087] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:26:30,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379671460] [2024-11-27 20:26:30,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:30,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:26:30,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:26:30,708 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:26:30,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 20:26:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:30,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-27 20:26:30,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:26:30,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:26:31,116 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 20:26:31,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-27 20:26:31,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:26:31,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-27 20:26:31,396 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:26:31,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-27 20:26:31,498 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:26:31,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-27 20:26:31,567 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:26:31,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-27 20:26:31,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-27 20:26:31,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:31,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:26:31,639 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1480 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1480) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-27 20:26:31,645 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1480 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1480) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-27 20:26:31,711 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1479))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1480)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-27 20:26:31,745 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1483 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1483))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1479)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1480)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-27 20:26:31,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379671460] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:26:31,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:26:31,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-11-27 20:26:31,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183411435] [2024-11-27 20:26:31,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:26:31,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-27 20:26:31,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:31,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-27 20:26:31,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=16, NotChecked=196, Total=812 [2024-11-27 20:26:31,748 INFO L87 Difference]: Start difference. First operand 1796 states and 2496 transitions. Second operand has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:26:34,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:34,999 INFO L93 Difference]: Finished difference Result 1798 states and 2500 transitions. [2024-11-27 20:26:34,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-27 20:26:34,999 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 100 [2024-11-27 20:26:35,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:35,002 INFO L225 Difference]: With dead ends: 1798 [2024-11-27 20:26:35,002 INFO L226 Difference]: Without dead ends: 1798 [2024-11-27 20:26:35,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=639, Unknown=17, NotChecked=220, Total=992 [2024-11-27 20:26:35,003 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 866 mSDsluCounter, 8584 mSDsCounter, 0 mSdLazyCounter, 5543 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 9221 SdHoareTripleChecker+Invalid, 5563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:35,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 9221 Invalid, 5563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 5543 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-27 20:26:35,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2024-11-27 20:26:35,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1795. [2024-11-27 20:26:35,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1485 states have (on average 1.6430976430976432) internal successors, (2440), 1783 states have internal predecessors, (2440), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-27 20:26:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2494 transitions. [2024-11-27 20:26:35,026 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2494 transitions. Word has length 100 [2024-11-27 20:26:35,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:35,026 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 2494 transitions. [2024-11-27 20:26:35,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:26:35,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2494 transitions. [2024-11-27 20:26:35,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-27 20:26:35,028 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:35,028 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:26:35,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-27 20:26:35,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-27 20:26:35,229 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:26:35,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:35,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1064509447, now seen corresponding path program 1 times [2024-11-27 20:26:35,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:35,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412096284] [2024-11-27 20:26:35,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:35,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:36,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:36,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:36,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412096284] [2024-11-27 20:26:36,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412096284] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:26:36,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308978984] [2024-11-27 20:26:36,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:36,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:26:36,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:26:36,304 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:26:36,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 20:26:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:36,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-27 20:26:36,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:26:36,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:26:36,865 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 20:26:36,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-27 20:26:36,875 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-27 20:26:36,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 20:26:36,910 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 1 [2024-11-27 20:26:37,083 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 20:26:37,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-27 20:26:37,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-27 20:26:37,183 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 20:26:37,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 45 [2024-11-27 20:26:37,189 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 24 treesize of output 11 [2024-11-27 20:26:37,279 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 20:26:37,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2024-11-27 20:26:37,288 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 35 treesize of output 11 [2024-11-27 20:26:37,306 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 25 treesize of output 13 [2024-11-27 20:26:37,311 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 7 treesize of output 3 [2024-11-27 20:26:37,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:37,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:26:38,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308978984] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:26:38,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:26:38,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2024-11-27 20:26:38,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454183337] [2024-11-27 20:26:38,312 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:26:38,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-27 20:26:38,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:38,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-27 20:26:38,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=799, Unknown=23, NotChecked=0, Total=930 [2024-11-27 20:26:38,316 INFO L87 Difference]: Start difference. First operand 1795 states and 2494 transitions. Second operand has 24 states, 21 states have (on average 9.095238095238095) internal successors, (191), 24 states have internal predecessors, (191), 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-27 20:26:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:41,861 INFO L93 Difference]: Finished difference Result 2317 states and 3236 transitions. [2024-11-27 20:26:41,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 20:26:41,861 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 9.095238095238095) internal successors, (191), 24 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 100 [2024-11-27 20:26:41,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:41,866 INFO L225 Difference]: With dead ends: 2317 [2024-11-27 20:26:41,866 INFO L226 Difference]: Without dead ends: 2317 [2024-11-27 20:26:41,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=191, Invalid=1191, Unknown=24, NotChecked=0, Total=1406 [2024-11-27 20:26:41,867 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 1299 mSDsluCounter, 7151 mSDsCounter, 0 mSdLazyCounter, 5603 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1313 SdHoareTripleChecker+Valid, 7795 SdHoareTripleChecker+Invalid, 5633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:41,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1313 Valid, 7795 Invalid, 5633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 5603 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-27 20:26:41,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2024-11-27 20:26:41,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 1773. [2024-11-27 20:26:41,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1465 states have (on average 1.6498293515358362) internal successors, (2417), 1763 states have internal predecessors, (2417), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-27 20:26:41,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2469 transitions. [2024-11-27 20:26:41,892 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2469 transitions. Word has length 100 [2024-11-27 20:26:41,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:41,893 INFO L471 AbstractCegarLoop]: Abstraction has 1773 states and 2469 transitions. [2024-11-27 20:26:41,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 9.095238095238095) internal successors, (191), 24 states have internal predecessors, (191), 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-27 20:26:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2469 transitions. [2024-11-27 20:26:41,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-27 20:26:41,894 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:41,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:26:41,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-27 20:26:42,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-27 20:26:42,095 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:26:42,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:42,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1031375504, now seen corresponding path program 1 times [2024-11-27 20:26:42,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:42,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925301152] [2024-11-27 20:26:42,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:42,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:42,651 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-27 20:26:42,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:42,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925301152] [2024-11-27 20:26:42,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925301152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:42,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:42,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-27 20:26:42,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619088580] [2024-11-27 20:26:42,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:42,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-27 20:26:42,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:42,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-27 20:26:42,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-27 20:26:42,653 INFO L87 Difference]: Start difference. First operand 1773 states and 2469 transitions. Second operand has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:26:44,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:44,298 INFO L93 Difference]: Finished difference Result 1804 states and 2506 transitions. [2024-11-27 20:26:44,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 20:26:44,299 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-11-27 20:26:44,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:44,303 INFO L225 Difference]: With dead ends: 1804 [2024-11-27 20:26:44,303 INFO L226 Difference]: Without dead ends: 1804 [2024-11-27 20:26:44,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-11-27 20:26:44,304 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 921 mSDsluCounter, 4344 mSDsCounter, 0 mSdLazyCounter, 2937 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 4984 SdHoareTripleChecker+Invalid, 2956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:44,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 4984 Invalid, 2956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2937 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-27 20:26:44,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2024-11-27 20:26:44,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1800. [2024-11-27 20:26:44,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1491 states have (on average 1.6405097250167673) internal successors, (2446), 1788 states have internal predecessors, (2446), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-27 20:26:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2500 transitions. [2024-11-27 20:26:44,327 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2500 transitions. Word has length 102 [2024-11-27 20:26:44,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:44,327 INFO L471 AbstractCegarLoop]: Abstraction has 1800 states and 2500 transitions. [2024-11-27 20:26:44,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:26:44,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2500 transitions. [2024-11-27 20:26:44,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-27 20:26:44,329 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:44,329 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:26:44,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-27 20:26:44,329 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:26:44,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:44,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1031375503, now seen corresponding path program 1 times [2024-11-27 20:26:44,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:44,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531283251] [2024-11-27 20:26:44,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:44,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:45,353 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-27 20:26:45,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:45,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531283251] [2024-11-27 20:26:45,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531283251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:45,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:45,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-27 20:26:45,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130284705] [2024-11-27 20:26:45,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:45,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-27 20:26:45,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:45,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-27 20:26:45,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-27 20:26:45,357 INFO L87 Difference]: Start difference. First operand 1800 states and 2500 transitions. Second operand has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:26:47,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:47,451 INFO L93 Difference]: Finished difference Result 1803 states and 2504 transitions. [2024-11-27 20:26:47,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 20:26:47,452 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-11-27 20:26:47,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:47,456 INFO L225 Difference]: With dead ends: 1803 [2024-11-27 20:26:47,456 INFO L226 Difference]: Without dead ends: 1803 [2024-11-27 20:26:47,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-27 20:26:47,457 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 897 mSDsluCounter, 3200 mSDsCounter, 0 mSdLazyCounter, 3092 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 3841 SdHoareTripleChecker+Invalid, 3109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:47,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 3841 Invalid, 3109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3092 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-27 20:26:47,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2024-11-27 20:26:47,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1800. [2024-11-27 20:26:47,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1491 states have (on average 1.6391683433936954) internal successors, (2444), 1788 states have internal predecessors, (2444), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-27 20:26:47,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2498 transitions. [2024-11-27 20:26:47,487 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2498 transitions. Word has length 102 [2024-11-27 20:26:47,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:47,488 INFO L471 AbstractCegarLoop]: Abstraction has 1800 states and 2498 transitions. [2024-11-27 20:26:47,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:26:47,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2498 transitions. [2024-11-27 20:26:47,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-27 20:26:47,489 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:47,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:26:47,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-27 20:26:47,490 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:26:47,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:47,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1236947498, now seen corresponding path program 1 times [2024-11-27 20:26:47,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:47,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356915498] [2024-11-27 20:26:47,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:47,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:48,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:48,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:48,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356915498] [2024-11-27 20:26:48,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356915498] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:26:48,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170596560] [2024-11-27 20:26:48,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:48,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:26:48,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:26:48,217 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:26:48,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 20:26:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:48,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-27 20:26:48,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:26:48,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:26:48,638 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 20:26:48,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-27 20:26:48,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:26:48,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-27 20:26:48,915 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:26:48,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-27 20:26:49,037 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:26:49,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-27 20:26:49,114 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:26:49,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-27 20:26:49,204 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:26:49,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-27 20:26:49,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-27 20:26:49,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:49,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:26:53,830 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1991 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1991))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1986)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1987)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1988)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-27 20:26:53,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170596560] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:26:53,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:26:53,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2024-11-27 20:26:53,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765723706] [2024-11-27 20:26:53,833 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:26:53,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-27 20:26:53,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:53,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-27 20:26:53,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=776, Unknown=80, NotChecked=60, Total=1056 [2024-11-27 20:26:53,835 INFO L87 Difference]: Start difference. First operand 1800 states and 2498 transitions. Second operand has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:26:57,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:57,846 INFO L93 Difference]: Finished difference Result 1802 states and 2502 transitions. [2024-11-27 20:26:57,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-27 20:26:57,847 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2024-11-27 20:26:57,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:57,849 INFO L225 Difference]: With dead ends: 1802 [2024-11-27 20:26:57,849 INFO L226 Difference]: Without dead ends: 1802 [2024-11-27 20:26:57,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=164, Invalid=948, Unknown=82, NotChecked=66, Total=1260 [2024-11-27 20:26:57,850 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 871 mSDsluCounter, 6184 mSDsCounter, 0 mSdLazyCounter, 4105 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 6820 SdHoareTripleChecker+Invalid, 4123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:57,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 6820 Invalid, 4123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4105 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-27 20:26:57,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2024-11-27 20:26:57,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1799. [2024-11-27 20:26:57,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1491 states have (on average 1.6378269617706238) internal successors, (2442), 1787 states have internal predecessors, (2442), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-27 20:26:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2496 transitions. [2024-11-27 20:26:57,875 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2496 transitions. Word has length 103 [2024-11-27 20:26:57,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:57,876 INFO L471 AbstractCegarLoop]: Abstraction has 1799 states and 2496 transitions. [2024-11-27 20:26:57,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:26:57,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2496 transitions. [2024-11-27 20:26:57,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-27 20:26:57,877 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:57,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:26:57,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-27 20:26:58,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-27 20:26:58,078 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:26:58,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:58,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1236947497, now seen corresponding path program 1 times [2024-11-27 20:26:58,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:58,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016661413] [2024-11-27 20:26:58,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:58,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:59,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:59,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:59,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016661413] [2024-11-27 20:26:59,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016661413] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:26:59,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249328325] [2024-11-27 20:26:59,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:59,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:26:59,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:26:59,332 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:26:59,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-27 20:26:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:59,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-27 20:26:59,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:26:59,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:26:59,788 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 20:26:59,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-27 20:26:59,795 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-27 20:26:59,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:26:59,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:26:59,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-27 20:26:59,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:27:00,153 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:27:00,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:27:00,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:27:00,273 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:27:00,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:27:00,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:27:00,358 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:27:00,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:27:00,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:27:00,450 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:27:00,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:27:00,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:27:00,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-27 20:27:00,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:27:00,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:00,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:27:00,612 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2172 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2024-11-27 20:27:00,626 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2172 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2024-11-27 20:27:00,657 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2170 (Array Int Int)) (v_ArrVal_2169 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2169))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2170) .cse0 v_ArrVal_2172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2170 (Array Int Int)) (v_ArrVal_2169 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2170) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-27 20:27:00,676 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2170 (Array Int Int)) (v_ArrVal_2169 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2169))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2170) .cse1 v_ArrVal_2172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2170 (Array Int Int)) (v_ArrVal_2169 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2170) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-27 20:27:00,713 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2170 (Array Int Int)) (v_ArrVal_2169 (Array Int Int)) (v_ArrVal_2168 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2168))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2167) .cse0 v_ArrVal_2170) (select (select (store .cse1 .cse0 v_ArrVal_2169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2172))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2170 (Array Int Int)) (v_ArrVal_2169 (Array Int Int)) (v_ArrVal_2168 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2168))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2169))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2167) .cse3 v_ArrVal_2170) .cse4 v_ArrVal_2172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-27 20:27:00,741 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2170 (Array Int Int)) (v_ArrVal_2169 (Array Int Int)) (v_ArrVal_2168 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2168))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2169))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2167) .cse1 v_ArrVal_2170) .cse2 v_ArrVal_2172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2170 (Array Int Int)) (v_ArrVal_2169 (Array Int Int)) (v_ArrVal_2168 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2168))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2167) .cse6 v_ArrVal_2170) (select (select (store .cse7 .cse6 v_ArrVal_2169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2172))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20)))))) is different from false [2024-11-27 20:27:00,838 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2170 (Array Int Int)) (v_ArrVal_2169 (Array Int Int)) (v_ArrVal_2168 (Array Int Int)) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2178))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2168))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2169))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2177) .cse0 v_ArrVal_2167) .cse1 v_ArrVal_2170) .cse2 v_ArrVal_2172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_2170 (Array Int Int)) (v_ArrVal_2169 (Array Int Int)) (v_ArrVal_2168 (Array Int Int)) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2178))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2168))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2177) .cse7 v_ArrVal_2167) .cse8 v_ArrVal_2170) (select (select (store .cse9 .cse8 v_ArrVal_2169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2172))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))) is different from false [2024-11-27 20:27:00,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249328325] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:27:00,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:27:00,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-11-27 20:27:00,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455883359] [2024-11-27 20:27:00,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:27:00,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-27 20:27:00,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:00,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-27 20:27:00,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=570, Unknown=7, NotChecked=378, Total=1056 [2024-11-27 20:27:00,844 INFO L87 Difference]: Start difference. First operand 1799 states and 2496 transitions. Second operand has 24 states, 21 states have (on average 7.904761904761905) internal successors, (166), 24 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:27:06,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:06,327 INFO L93 Difference]: Finished difference Result 1801 states and 2500 transitions. [2024-11-27 20:27:06,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-27 20:27:06,328 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.904761904761905) internal successors, (166), 24 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2024-11-27 20:27:06,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:06,330 INFO L225 Difference]: With dead ends: 1801 [2024-11-27 20:27:06,330 INFO L226 Difference]: Without dead ends: 1801 [2024-11-27 20:27:06,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=164, Invalid=913, Unknown=7, NotChecked=476, Total=1560 [2024-11-27 20:27:06,331 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 880 mSDsluCounter, 6365 mSDsCounter, 0 mSdLazyCounter, 5784 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 7004 SdHoareTripleChecker+Invalid, 5807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 5784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:06,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 7004 Invalid, 5807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 5784 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-27 20:27:06,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2024-11-27 20:27:06,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1771. [2024-11-27 20:27:06,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1465 states have (on average 1.647098976109215) internal successors, (2413), 1761 states have internal predecessors, (2413), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-27 20:27:06,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2465 transitions. [2024-11-27 20:27:06,352 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2465 transitions. Word has length 103 [2024-11-27 20:27:06,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:06,353 INFO L471 AbstractCegarLoop]: Abstraction has 1771 states and 2465 transitions. [2024-11-27 20:27:06,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.904761904761905) internal successors, (166), 24 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:27:06,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2465 transitions. [2024-11-27 20:27:06,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-27 20:27:06,354 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:06,354 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:27:06,365 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-27 20:27:06,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-27 20:27:06,555 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:27:06,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:06,556 INFO L85 PathProgramCache]: Analyzing trace with hash -2018907726, now seen corresponding path program 1 times [2024-11-27 20:27:06,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:27:06,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749684899] [2024-11-27 20:27:06,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:06,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:27:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:07,362 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-27 20:27:07,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:27:07,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749684899] [2024-11-27 20:27:07,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749684899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:27:07,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:27:07,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-27 20:27:07,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063864999] [2024-11-27 20:27:07,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:27:07,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-27 20:27:07,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:07,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-27 20:27:07,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-27 20:27:07,363 INFO L87 Difference]: Start difference. First operand 1771 states and 2465 transitions. Second operand has 14 states, 13 states have (on average 8.0) internal successors, (104), 14 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:27:10,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:10,714 INFO L93 Difference]: Finished difference Result 1810 states and 2510 transitions. [2024-11-27 20:27:10,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 20:27:10,714 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 8.0) internal successors, (104), 14 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-27 20:27:10,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:10,717 INFO L225 Difference]: With dead ends: 1810 [2024-11-27 20:27:10,717 INFO L226 Difference]: Without dead ends: 1810 [2024-11-27 20:27:10,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2024-11-27 20:27:10,718 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 919 mSDsluCounter, 5485 mSDsCounter, 0 mSdLazyCounter, 3653 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 6124 SdHoareTripleChecker+Invalid, 3673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:10,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 6124 Invalid, 3673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3653 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-27 20:27:10,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2024-11-27 20:27:10,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1806. [2024-11-27 20:27:10,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1499 states have (on average 1.6344229486324215) internal successors, (2450), 1794 states have internal predecessors, (2450), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-27 20:27:10,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2504 transitions. [2024-11-27 20:27:10,758 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2504 transitions. Word has length 106 [2024-11-27 20:27:10,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:10,758 INFO L471 AbstractCegarLoop]: Abstraction has 1806 states and 2504 transitions. [2024-11-27 20:27:10,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 8.0) internal successors, (104), 14 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:27:10,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2504 transitions. [2024-11-27 20:27:10,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-27 20:27:10,759 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:10,759 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:27:10,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-27 20:27:10,760 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:27:10,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:10,761 INFO L85 PathProgramCache]: Analyzing trace with hash -2018907725, now seen corresponding path program 1 times [2024-11-27 20:27:10,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:27:10,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834327431] [2024-11-27 20:27:10,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:10,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:27:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:12,225 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-27 20:27:12,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:27:12,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834327431] [2024-11-27 20:27:12,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834327431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:27:12,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:27:12,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-27 20:27:12,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260810109] [2024-11-27 20:27:12,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:27:12,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-27 20:27:12,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:12,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-27 20:27:12,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-27 20:27:12,227 INFO L87 Difference]: Start difference. First operand 1806 states and 2504 transitions. Second operand has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:27:19,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:19,426 INFO L93 Difference]: Finished difference Result 1809 states and 2508 transitions. [2024-11-27 20:27:19,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-27 20:27:19,426 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-27 20:27:19,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:19,429 INFO L225 Difference]: With dead ends: 1809 [2024-11-27 20:27:19,429 INFO L226 Difference]: Without dead ends: 1809 [2024-11-27 20:27:19,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-27 20:27:19,430 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 915 mSDsluCounter, 7155 mSDsCounter, 0 mSdLazyCounter, 6964 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 7792 SdHoareTripleChecker+Invalid, 6985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 6964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:19,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 7792 Invalid, 6985 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 6964 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-27 20:27:19,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2024-11-27 20:27:19,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1806. [2024-11-27 20:27:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1499 states have (on average 1.6330887258172115) internal successors, (2448), 1794 states have internal predecessors, (2448), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-27 20:27:19,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2502 transitions. [2024-11-27 20:27:19,446 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2502 transitions. Word has length 106 [2024-11-27 20:27:19,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:19,447 INFO L471 AbstractCegarLoop]: Abstraction has 1806 states and 2502 transitions. [2024-11-27 20:27:19,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:27:19,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2502 transitions. [2024-11-27 20:27:19,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-27 20:27:19,448 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:19,448 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:27:19,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-27 20:27:19,448 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:27:19,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:19,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1632993512, now seen corresponding path program 1 times [2024-11-27 20:27:19,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:27:19,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034691503] [2024-11-27 20:27:19,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:19,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:27:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:20,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:20,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:27:20,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034691503] [2024-11-27 20:27:20,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034691503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:27:20,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469293217] [2024-11-27 20:27:20,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:20,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:27:20,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:27:20,716 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:27:20,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-27 20:27:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:21,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-27 20:27:21,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:27:21,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:27:21,354 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 20:27:21,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-27 20:27:21,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:27:21,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-27 20:27:21,777 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:27:21,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-27 20:27:21,973 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:27:21,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-27 20:27:22,091 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:27:22,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-27 20:27:22,200 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:27:22,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-27 20:27:22,331 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:27:22,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-27 20:27:22,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-27 20:27:22,482 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-27 20:27:22,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-11-27 20:27:22,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:22,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:27:23,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469293217] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:27:23,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:27:23,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2024-11-27 20:27:23,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624715213] [2024-11-27 20:27:23,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:27:23,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-27 20:27:23,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:23,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-27 20:27:23,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1235, Unknown=51, NotChecked=0, Total=1482 [2024-11-27 20:27:23,728 INFO L87 Difference]: Start difference. First operand 1806 states and 2502 transitions. Second operand has 28 states, 25 states have (on average 6.96) internal successors, (174), 27 states have internal predecessors, (174), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:27:28,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:28,132 INFO L93 Difference]: Finished difference Result 1808 states and 2506 transitions. [2024-11-27 20:27:28,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-27 20:27:28,133 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 6.96) internal successors, (174), 27 states have internal predecessors, (174), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 107 [2024-11-27 20:27:28,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:28,135 INFO L225 Difference]: With dead ends: 1808 [2024-11-27 20:27:28,135 INFO L226 Difference]: Without dead ends: 1808 [2024-11-27 20:27:28,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=223, Invalid=1448, Unknown=51, NotChecked=0, Total=1722 [2024-11-27 20:27:28,136 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 867 mSDsluCounter, 6156 mSDsCounter, 0 mSdLazyCounter, 4093 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 6791 SdHoareTripleChecker+Invalid, 4114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:28,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 6791 Invalid, 4114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4093 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-27 20:27:28,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2024-11-27 20:27:28,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1805. [2024-11-27 20:27:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1805 states, 1499 states have (on average 1.6317545030020013) internal successors, (2446), 1793 states have internal predecessors, (2446), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-27 20:27:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 2500 transitions. [2024-11-27 20:27:28,164 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 2500 transitions. Word has length 107 [2024-11-27 20:27:28,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:28,164 INFO L471 AbstractCegarLoop]: Abstraction has 1805 states and 2500 transitions. [2024-11-27 20:27:28,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 6.96) internal successors, (174), 27 states have internal predecessors, (174), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:27:28,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2500 transitions. [2024-11-27 20:27:28,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-27 20:27:28,166 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:28,166 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:27:28,178 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-27 20:27:28,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:27:28,367 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:27:28,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:28,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1632993511, now seen corresponding path program 1 times [2024-11-27 20:27:28,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:27:28,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490434028] [2024-11-27 20:27:28,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:28,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:27:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:29,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:29,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:27:29,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490434028] [2024-11-27 20:27:29,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490434028] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:27:29,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343476541] [2024-11-27 20:27:29,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:29,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:27:29,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:27:29,950 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:27:29,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-27 20:27:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:30,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-27 20:27:30,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:27:30,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:27:30,578 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 20:27:30,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-27 20:27:30,600 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-27 20:27:30,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:27:30,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:27:30,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-27 20:27:30,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:27:31,225 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:27:31,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-27 20:27:31,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:27:31,417 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:27:31,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-27 20:27:31,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:27:31,587 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:27:31,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-27 20:27:31,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:27:31,738 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:27:31,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-27 20:27:31,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:27:31,901 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:27:31,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-27 20:27:31,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:27:31,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-27 20:27:31,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:27:32,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:27:32,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-27 20:27:32,097 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-27 20:27:32,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-27 20:27:32,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:32,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:27:32,717 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2745 (Array Int Int)) (v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2743 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2744) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2743) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2745) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)))) (forall ((v_ArrVal_2746 (Array Int Int)) (v_ArrVal_2745 (Array Int Int)) (v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2743 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2747 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2743))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2744) .cse1 v_ArrVal_2745) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2747) (select (select (store .cse2 .cse1 v_ArrVal_2746) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))) is different from false [2024-11-27 20:27:47,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343476541] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:27:47,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:27:47,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2024-11-27 20:27:47,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787543670] [2024-11-27 20:27:47,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:27:47,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-27 20:27:47,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:47,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-27 20:27:47,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1411, Unknown=52, NotChecked=78, Total=1722 [2024-11-27 20:27:47,988 INFO L87 Difference]: Start difference. First operand 1805 states and 2500 transitions. Second operand has 30 states, 27 states have (on average 6.444444444444445) internal successors, (174), 29 states have internal predecessors, (174), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:28:15,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:28:15,168 INFO L93 Difference]: Finished difference Result 1807 states and 2504 transitions. [2024-11-27 20:28:15,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-27 20:28:15,168 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 6.444444444444445) internal successors, (174), 29 states have internal predecessors, (174), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 107 [2024-11-27 20:28:15,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:28:15,171 INFO L225 Difference]: With dead ends: 1807 [2024-11-27 20:28:15,172 INFO L226 Difference]: Without dead ends: 1807 [2024-11-27 20:28:15,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=308, Invalid=2194, Unknown=52, NotChecked=98, Total=2652 [2024-11-27 20:28:15,173 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 870 mSDsluCounter, 8582 mSDsCounter, 0 mSdLazyCounter, 8388 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 9217 SdHoareTripleChecker+Invalid, 8416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 8388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:28:15,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 9217 Invalid, 8416 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 8388 Invalid, 0 Unknown, 0 Unchecked, 25.5s Time] [2024-11-27 20:28:15,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2024-11-27 20:28:15,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1769. [2024-11-27 20:28:15,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1465 states have (on average 1.644368600682594) internal successors, (2409), 1759 states have internal predecessors, (2409), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-27 20:28:15,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2461 transitions. [2024-11-27 20:28:15,200 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2461 transitions. Word has length 107 [2024-11-27 20:28:15,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:28:15,200 INFO L471 AbstractCegarLoop]: Abstraction has 1769 states and 2461 transitions. [2024-11-27 20:28:15,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 6.444444444444445) internal successors, (174), 29 states have internal predecessors, (174), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:28:15,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2461 transitions. [2024-11-27 20:28:15,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-27 20:28:15,201 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:28:15,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:28:15,208 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-27 20:28:15,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:28:15,401 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:28:15,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:28:15,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1442623193, now seen corresponding path program 1 times [2024-11-27 20:28:15,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:28:15,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613716996] [2024-11-27 20:28:15,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:28:15,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:28:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:28:16,023 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-27 20:28:16,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:28:16,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613716996] [2024-11-27 20:28:16,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613716996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:28:16,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:28:16,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:28:16,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355865267] [2024-11-27 20:28:16,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:28:16,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:28:16,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:28:16,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:28:16,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:28:16,025 INFO L87 Difference]: Start difference. First operand 1769 states and 2461 transitions. Second operand has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:28:19,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:28:19,095 INFO L93 Difference]: Finished difference Result 1768 states and 2459 transitions. [2024-11-27 20:28:19,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:28:19,096 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-27 20:28:19,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:28:19,097 INFO L225 Difference]: With dead ends: 1768 [2024-11-27 20:28:19,097 INFO L226 Difference]: Without dead ends: 1768 [2024-11-27 20:28:19,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:28:19,098 INFO L435 NwaCegarLoop]: 973 mSDtfsCounter, 2 mSDsluCounter, 2968 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3941 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:28:19,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3941 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-27 20:28:19,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2024-11-27 20:28:19,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1768. [2024-11-27 20:28:19,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1768 states, 1465 states have (on average 1.6430034129692832) internal successors, (2407), 1758 states have internal predecessors, (2407), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-27 20:28:19,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 2459 transitions. [2024-11-27 20:28:19,120 INFO L78 Accepts]: Start accepts. Automaton has 1768 states and 2459 transitions. Word has length 109 [2024-11-27 20:28:19,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:28:19,121 INFO L471 AbstractCegarLoop]: Abstraction has 1768 states and 2459 transitions. [2024-11-27 20:28:19,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:28:19,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2459 transitions. [2024-11-27 20:28:19,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-27 20:28:19,122 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:28:19,122 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:28:19,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-27 20:28:19,122 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:28:19,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:28:19,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1442623194, now seen corresponding path program 1 times [2024-11-27 20:28:19,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:28:19,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908218424] [2024-11-27 20:28:19,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:28:19,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:28:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:28:22,189 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-27 20:28:22,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:28:22,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908218424] [2024-11-27 20:28:22,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908218424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:28:22,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:28:22,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-27 20:28:22,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618887090] [2024-11-27 20:28:22,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:28:22,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-27 20:28:22,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:28:22,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-27 20:28:22,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-27 20:28:22,191 INFO L87 Difference]: Start difference. First operand 1768 states and 2459 transitions. Second operand has 19 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:28:35,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:28:35,655 INFO L93 Difference]: Finished difference Result 1812 states and 2508 transitions. [2024-11-27 20:28:35,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-27 20:28:35,655 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-27 20:28:35,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:28:35,657 INFO L225 Difference]: With dead ends: 1812 [2024-11-27 20:28:35,658 INFO L226 Difference]: Without dead ends: 1812 [2024-11-27 20:28:35,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-11-27 20:28:35,658 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 917 mSDsluCounter, 4157 mSDsCounter, 0 mSdLazyCounter, 4113 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 4793 SdHoareTripleChecker+Invalid, 4135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:28:35,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 4793 Invalid, 4135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 4113 Invalid, 0 Unknown, 0 Unchecked, 12.5s Time] [2024-11-27 20:28:35,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2024-11-27 20:28:35,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1809. [2024-11-27 20:28:35,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1505 states have (on average 1.626578073089701) internal successors, (2448), 1797 states have internal predecessors, (2448), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-27 20:28:35,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2502 transitions. [2024-11-27 20:28:35,675 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2502 transitions. Word has length 109 [2024-11-27 20:28:35,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:28:35,675 INFO L471 AbstractCegarLoop]: Abstraction has 1809 states and 2502 transitions. [2024-11-27 20:28:35,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:28:35,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2502 transitions. [2024-11-27 20:28:35,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-27 20:28:35,676 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:28:35,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:28:35,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-27 20:28:35,676 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:28:35,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:28:35,677 INFO L85 PathProgramCache]: Analyzing trace with hash 585521076, now seen corresponding path program 1 times [2024-11-27 20:28:35,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:28:35,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124257409] [2024-11-27 20:28:35,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:28:35,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:28:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:28:38,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:28:38,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:28:38,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124257409] [2024-11-27 20:28:38,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124257409] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:28:38,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940078822] [2024-11-27 20:28:38,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:28:38,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:28:38,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:28:38,306 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:28:38,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-27 20:28:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:28:38,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-27 20:28:38,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:28:38,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:28:39,185 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-27 20:28:39,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-27 20:28:39,214 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-27 20:28:39,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:28:39,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:28:39,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-27 20:28:39,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:28:40,403 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:28:40,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-27 20:28:40,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:28:40,853 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:28:40,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-27 20:28:40,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:28:41,195 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:28:41,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-27 20:28:41,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:28:41,520 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:28:41,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-27 20:28:41,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:28:41,892 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:28:41,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-27 20:28:41,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:28:42,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:28:42,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-27 20:28:42,402 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-27 20:28:42,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2024-11-27 20:28:42,630 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:28:42,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:28:42,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:28:42,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-27 20:28:42,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:28:42,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:28:42,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:28:44,200 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (or (forall ((v_ArrVal_3152 (Array Int Int)) (v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_3148))) (or (< 0 (+ 41 (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_3149) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3152) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (forall ((v_ArrVal_3148 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_3148))) (or (< (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 0) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3149 (Array Int Int))) (or (forall ((v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3150 Int) (v_ArrVal_3152 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_3149))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 44 (select (select (store .cse3 .cse4 v_ArrVal_3152) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3150) (select (select (store .cse5 .cse4 v_ArrVal_3151) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))))))))) is different from false [2024-11-27 20:28:44,362 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0))) (forall ((v_ArrVal_3152 (Array Int Int)) (v_ArrVal_3146 (Array Int Int)) (v_ArrVal_3147 (Array Int Int)) (v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3147))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3146) .cse3 v_ArrVal_3148))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 0) (< 0 (+ 41 (select (select (store .cse0 (select (select (store .cse2 .cse3 v_ArrVal_3149) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3152) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) (forall ((v_ArrVal_3146 (Array Int Int)) (v_ArrVal_3147 (Array Int Int)) (v_ArrVal_3148 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3147))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3146) .cse8 v_ArrVal_3148))) (or (< (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 0) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3149 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)) (forall ((v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3150 Int) (v_ArrVal_3152 (Array Int Int))) (let ((.cse6 (store .cse7 .cse8 v_ArrVal_3149))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 44 (select (select (store .cse4 .cse5 v_ArrVal_3152) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3150) (select (select (store .cse6 .cse5 v_ArrVal_3151) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))))))) is different from false [2024-11-27 20:28:44,948 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_3152 (Array Int Int)) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3146 (Array Int Int)) (v_ArrVal_3147 (Array Int Int)) (v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3145))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store .cse5 .cse4 v_ArrVal_3147))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3144) .cse4 v_ArrVal_3146) .cse2 v_ArrVal_3148))) (or (< 0 (+ 41 (select (select (store .cse0 (select (select (store .cse1 .cse2 v_ArrVal_3149) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_3152) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 0)))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (forall ((v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3146 (Array Int Int)) (v_ArrVal_3147 (Array Int Int)) (v_ArrVal_3148 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3145))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse12 .cse11 v_ArrVal_3147))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_3144) .cse11 v_ArrVal_3146) .cse10 v_ArrVal_3148))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3149 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)) (forall ((v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3150 Int) (v_ArrVal_3152 (Array Int Int))) (let ((.cse8 (store .cse9 .cse10 v_ArrVal_3149))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store .cse6 .cse7 v_ArrVal_3152) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3150) (select (select (store .cse8 .cse7 v_ArrVal_3151) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (< (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 0)))))))))) is different from false [2024-11-27 20:28:45,037 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (or (forall ((v_ArrVal_3152 (Array Int Int)) (v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3146 (Array Int Int)) (v_ArrVal_3147 (Array Int Int)) (v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3145))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse6 .cse5 v_ArrVal_3147))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_3144) .cse5 v_ArrVal_3146) .cse3 v_ArrVal_3148))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 0) (< 0 (+ 41 (select (select (store .cse0 (select (select (store .cse2 .cse3 v_ArrVal_3149) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3152) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (forall ((v_ArrVal_3144 (Array Int Int)) (v_ArrVal_3145 (Array Int Int)) (v_ArrVal_3146 (Array Int Int)) (v_ArrVal_3147 (Array Int Int)) (v_ArrVal_3148 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_3145))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse10 (store .cse13 .cse12 v_ArrVal_3147))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_3144) .cse12 v_ArrVal_3146) .cse11 v_ArrVal_3148))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3149 (Array Int Int))) (or (forall ((v_ArrVal_3151 (Array Int Int)) (v_ArrVal_3150 Int) (v_ArrVal_3152 (Array Int Int))) (let ((.cse9 (store .cse10 .cse11 v_ArrVal_3149))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse7 .cse8 v_ArrVal_3152) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 44) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3150) (select (select (store .cse9 .cse8 v_ArrVal_3151) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0)))) (< (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 0))))))))))) is different from false [2024-11-27 20:29:16,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940078822] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:29:16,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:29:16,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 30 [2024-11-27 20:29:16,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519063936] [2024-11-27 20:29:16,567 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:29:16,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-27 20:29:16,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:16,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-27 20:29:16,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1436, Unknown=28, NotChecked=324, Total=1980 [2024-11-27 20:29:16,568 INFO L87 Difference]: Start difference. First operand 1809 states and 2502 transitions. Second operand has 31 states, 28 states have (on average 6.392857142857143) internal successors, (179), 30 states have internal predecessors, (179), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:29:50,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:29:50,467 INFO L93 Difference]: Finished difference Result 1811 states and 2506 transitions. [2024-11-27 20:29:50,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-27 20:29:50,468 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 6.392857142857143) internal successors, (179), 30 states have internal predecessors, (179), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2024-11-27 20:29:50,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:29:50,470 INFO L225 Difference]: With dead ends: 1811 [2024-11-27 20:29:50,470 INFO L226 Difference]: Without dead ends: 1811 [2024-11-27 20:29:50,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 37.4s TimeCoverageRelationStatistics Valid=325, Invalid=2315, Unknown=28, NotChecked=412, Total=3080 [2024-11-27 20:29:50,472 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 861 mSDsluCounter, 7778 mSDsCounter, 0 mSdLazyCounter, 7306 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 8412 SdHoareTripleChecker+Invalid, 7333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 7306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:29:50,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 8412 Invalid, 7333 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 7306 Invalid, 0 Unknown, 0 Unchecked, 31.5s Time] [2024-11-27 20:29:50,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2024-11-27 20:29:50,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1767. [2024-11-27 20:29:50,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1767 states, 1465 states have (on average 1.6416382252559727) internal successors, (2405), 1757 states have internal predecessors, (2405), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-27 20:29:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2457 transitions. [2024-11-27 20:29:50,490 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2457 transitions. Word has length 110 [2024-11-27 20:29:50,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:29:50,490 INFO L471 AbstractCegarLoop]: Abstraction has 1767 states and 2457 transitions. [2024-11-27 20:29:50,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 6.392857142857143) internal successors, (179), 30 states have internal predecessors, (179), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:29:50,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2457 transitions. [2024-11-27 20:29:50,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-27 20:29:50,491 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:29:50,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:29:50,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-27 20:29:50,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:29:50,692 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:29:50,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:29:50,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1745461113, now seen corresponding path program 1 times [2024-11-27 20:29:50,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:29:50,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340276067] [2024-11-27 20:29:50,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:29:50,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:29:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:29:52,511 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-27 20:29:52,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:29:52,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340276067] [2024-11-27 20:29:52,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340276067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:29:52,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:29:52,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-27 20:29:52,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436654537] [2024-11-27 20:29:52,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:29:52,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-27 20:29:52,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:29:52,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-27 20:29:52,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-27 20:29:52,514 INFO L87 Difference]: Start difference. First operand 1767 states and 2457 transitions. Second operand has 17 states, 16 states have (on average 6.875) internal successors, (110), 17 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:30:12,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:30:12,346 INFO L93 Difference]: Finished difference Result 1852 states and 2562 transitions. [2024-11-27 20:30:12,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-27 20:30:12,347 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.875) internal successors, (110), 17 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2024-11-27 20:30:12,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:30:12,348 INFO L225 Difference]: With dead ends: 1852 [2024-11-27 20:30:12,349 INFO L226 Difference]: Without dead ends: 1852 [2024-11-27 20:30:12,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2024-11-27 20:30:12,349 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 982 mSDsluCounter, 7409 mSDsCounter, 0 mSdLazyCounter, 4696 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 8045 SdHoareTripleChecker+Invalid, 4729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 4696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.9s IncrementalHoareTripleChecker+Time [2024-11-27 20:30:12,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 8045 Invalid, 4729 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 4696 Invalid, 0 Unknown, 0 Unchecked, 18.9s Time] [2024-11-27 20:30:12,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2024-11-27 20:30:12,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1814. [2024-11-27 20:30:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1814 states, 1511 states have (on average 1.6240900066181336) internal successors, (2454), 1802 states have internal predecessors, (2454), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-27 20:30:12,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 2508 transitions. [2024-11-27 20:30:12,365 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 2508 transitions. Word has length 112 [2024-11-27 20:30:12,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:30:12,365 INFO L471 AbstractCegarLoop]: Abstraction has 1814 states and 2508 transitions. [2024-11-27 20:30:12,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.875) internal successors, (110), 17 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:30:12,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2508 transitions. [2024-11-27 20:30:12,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-27 20:30:12,366 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:30:12,366 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:30:12,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-27 20:30:12,366 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:30:12,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:30:12,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1745461114, now seen corresponding path program 1 times [2024-11-27 20:30:12,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:30:12,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980683805] [2024-11-27 20:30:12,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:30:12,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:30:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:30:15,041 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-27 20:30:15,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:30:15,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980683805] [2024-11-27 20:30:15,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980683805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:30:15,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:30:15,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-27 20:30:15,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142075012] [2024-11-27 20:30:15,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:30:15,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 20:30:15,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:30:15,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 20:30:15,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:30:15,043 INFO L87 Difference]: Start difference. First operand 1814 states and 2508 transitions. Second operand has 12 states, 11 states have (on average 10.0) internal successors, (110), 12 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:30:27,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:30:27,917 INFO L93 Difference]: Finished difference Result 1813 states and 2504 transitions. [2024-11-27 20:30:27,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 20:30:27,917 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 10.0) internal successors, (110), 12 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2024-11-27 20:30:27,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:30:27,919 INFO L225 Difference]: With dead ends: 1813 [2024-11-27 20:30:27,919 INFO L226 Difference]: Without dead ends: 1813 [2024-11-27 20:30:27,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-11-27 20:30:27,920 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 911 mSDsluCounter, 3341 mSDsCounter, 0 mSdLazyCounter, 2811 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 3983 SdHoareTripleChecker+Invalid, 2818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:30:27,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 3983 Invalid, 2818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2811 Invalid, 0 Unknown, 0 Unchecked, 12.1s Time] [2024-11-27 20:30:27,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2024-11-27 20:30:27,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1813. [2024-11-27 20:30:27,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1813 states, 1511 states have (on average 1.6214427531436135) internal successors, (2450), 1801 states have internal predecessors, (2450), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-27 20:30:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 2504 transitions. [2024-11-27 20:30:27,936 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 2504 transitions. Word has length 112 [2024-11-27 20:30:27,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:30:27,937 INFO L471 AbstractCegarLoop]: Abstraction has 1813 states and 2504 transitions. [2024-11-27 20:30:27,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 10.0) internal successors, (110), 12 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:30:27,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2504 transitions. [2024-11-27 20:30:27,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-27 20:30:27,937 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:30:27,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:30:27,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-27 20:30:27,938 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:30:27,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:30:27,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1396838495, now seen corresponding path program 1 times [2024-11-27 20:30:27,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:30:27,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986024098] [2024-11-27 20:30:27,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:30:27,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:30:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:30:30,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:30:30,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:30:30,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986024098] [2024-11-27 20:30:30,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986024098] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:30:30,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202815654] [2024-11-27 20:30:30,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:30:30,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:30:30,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:30:30,011 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:30:30,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-27 20:30:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:30:30,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-27 20:30:30,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:30:30,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:30:31,055 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 20:30:31,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-27 20:30:31,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:30:31,272 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:30:31,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-27 20:30:31,500 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:30:31,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-27 20:30:31,730 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:30:31,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-27 20:30:31,968 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:30:31,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-27 20:30:32,207 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:30:32,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-27 20:30:32,316 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:30:32,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-27 20:30:32,609 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:30:32,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-27 20:30:32,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-27 20:30:32,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:30:32,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:30:32,887 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3571 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3571) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-27 20:30:32,946 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-27 20:30:32,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-27 20:30:33,415 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3570 (Array Int Int)) (v_ArrVal_3571 (Array Int Int)) (v_ArrVal_3569 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_3569)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3570))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3571)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-27 20:30:33,652 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3570 (Array Int Int)) (v_ArrVal_3571 (Array Int Int)) (v_ArrVal_3568 (Array Int Int)) (v_ArrVal_3569 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_3568))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3569)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3570))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3571)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-27 20:30:33,675 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3570 (Array Int Int)) (v_ArrVal_3571 (Array Int Int)) (v_ArrVal_3568 (Array Int Int)) (v_ArrVal_3569 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3568))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3569)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3570))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3571)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-27 20:30:34,282 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3570 (Array Int Int)) (v_ArrVal_3571 (Array Int Int)) (v_ArrVal_3566 (Array Int Int)) (v_ArrVal_3567 (Array Int Int)) (v_ArrVal_3568 (Array Int Int)) (v_ArrVal_3569 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3566))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3567)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3568)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3569)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_3570))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_3571)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-27 20:30:34,327 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3570 (Array Int Int)) (v_ArrVal_3571 (Array Int Int)) (v_ArrVal_3566 (Array Int Int)) (v_ArrVal_3567 (Array Int Int)) (v_ArrVal_3568 (Array Int Int)) (v_ArrVal_3569 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3566))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3567)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3568)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3569)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3570))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3571)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-27 20:30:34,466 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3570 (Array Int Int)) (v_ArrVal_3571 (Array Int Int)) (v_ArrVal_3574 (Array Int Int)) (v_ArrVal_3566 (Array Int Int)) (v_ArrVal_3567 (Array Int Int)) (v_ArrVal_3568 (Array Int Int)) (v_ArrVal_3569 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3574))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3566)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3567)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3568)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3569)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_3570))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3571)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-27 20:30:34,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202815654] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:30:34,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:30:34,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 23 [2024-11-27 20:30:34,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229071536] [2024-11-27 20:30:34,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:30:34,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-27 20:30:34,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:30:34,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-27 20:30:34,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=705, Unknown=54, NotChecked=434, Total=1332 [2024-11-27 20:30:34,472 INFO L87 Difference]: Start difference. First operand 1813 states and 2504 transitions. Second operand has 24 states, 22 states have (on average 7.5) internal successors, (165), 24 states have internal predecessors, (165), 1 states have call successors, (1), 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-27 20:30:52,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:30:52,483 INFO L93 Difference]: Finished difference Result 1837 states and 2536 transitions. [2024-11-27 20:30:52,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-27 20:30:52,484 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 7.5) internal successors, (165), 24 states have internal predecessors, (165), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2024-11-27 20:30:52,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:30:52,486 INFO L225 Difference]: With dead ends: 1837 [2024-11-27 20:30:52,486 INFO L226 Difference]: Without dead ends: 1837 [2024-11-27 20:30:52,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=258, Invalid=1356, Unknown=54, NotChecked=588, Total=2256 [2024-11-27 20:30:52,487 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 961 mSDsluCounter, 6231 mSDsCounter, 0 mSdLazyCounter, 4161 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 6867 SdHoareTripleChecker+Invalid, 4194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 4161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2024-11-27 20:30:52,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 6867 Invalid, 4194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 4161 Invalid, 0 Unknown, 0 Unchecked, 16.8s Time] [2024-11-27 20:30:52,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2024-11-27 20:30:52,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1765. [2024-11-27 20:30:52,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1765 states, 1465 states have (on average 1.6389078498293514) internal successors, (2401), 1755 states have internal predecessors, (2401), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-27 20:30:52,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2453 transitions. [2024-11-27 20:30:52,508 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2453 transitions. Word has length 113 [2024-11-27 20:30:52,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:30:52,508 INFO L471 AbstractCegarLoop]: Abstraction has 1765 states and 2453 transitions. [2024-11-27 20:30:52,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 7.5) internal successors, (165), 24 states have internal predecessors, (165), 1 states have call successors, (1), 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-27 20:30:52,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2453 transitions. [2024-11-27 20:30:52,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-27 20:30:52,509 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:30:52,509 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:30:52,522 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-27 20:30:52,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-27 20:30:52,710 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:30:52,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:30:52,710 INFO L85 PathProgramCache]: Analyzing trace with hash -136333203, now seen corresponding path program 1 times [2024-11-27 20:30:52,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:30:52,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139766178] [2024-11-27 20:30:52,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:30:52,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:30:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:30:52,887 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-27 20:30:52,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:30:52,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139766178] [2024-11-27 20:30:52,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139766178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:30:52,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:30:52,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:30:52,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293385533] [2024-11-27 20:30:52,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:30:52,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:30:52,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:30:52,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:30:52,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:30:52,888 INFO L87 Difference]: Start difference. First operand 1765 states and 2453 transitions. Second operand has 5 states, 4 states have (on average 28.25) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (1), 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-27 20:30:56,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:30:56,449 INFO L93 Difference]: Finished difference Result 1764 states and 2451 transitions. [2024-11-27 20:30:56,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:30:56,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.25) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (1), 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 115 [2024-11-27 20:30:56,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:30:56,452 INFO L225 Difference]: With dead ends: 1764 [2024-11-27 20:30:56,452 INFO L226 Difference]: Without dead ends: 1764 [2024-11-27 20:30:56,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:30:56,453 INFO L435 NwaCegarLoop]: 969 mSDtfsCounter, 5 mSDsluCounter, 2116 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3085 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:30:56,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3085 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-27 20:30:56,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2024-11-27 20:30:56,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1764. [2024-11-27 20:30:56,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1465 states have (on average 1.637542662116041) internal successors, (2399), 1754 states have internal predecessors, (2399), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-27 20:30:56,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 2451 transitions. [2024-11-27 20:30:56,476 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 2451 transitions. Word has length 115 [2024-11-27 20:30:56,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:30:56,476 INFO L471 AbstractCegarLoop]: Abstraction has 1764 states and 2451 transitions. [2024-11-27 20:30:56,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.25) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (1), 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-27 20:30:56,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2451 transitions. [2024-11-27 20:30:56,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-27 20:30:56,477 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:30:56,477 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:30:56,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-27 20:30:56,477 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:30:56,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:30:56,477 INFO L85 PathProgramCache]: Analyzing trace with hash -136333202, now seen corresponding path program 1 times [2024-11-27 20:30:56,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:30:56,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341673055] [2024-11-27 20:30:56,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:30:56,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:30:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:30:58,930 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-27 20:30:58,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:30:58,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341673055] [2024-11-27 20:30:58,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341673055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:30:58,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:30:58,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-27 20:30:58,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553648917] [2024-11-27 20:30:58,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:30:58,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-27 20:30:58,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:30:58,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-27 20:30:58,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-27 20:30:58,932 INFO L87 Difference]: Start difference. First operand 1764 states and 2451 transitions. Second operand has 18 states, 17 states have (on average 6.647058823529412) internal successors, (113), 18 states have internal predecessors, (113), 1 states have call successors, (1), 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-27 20:31:23,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:31:23,447 INFO L93 Difference]: Finished difference Result 1846 states and 2550 transitions. [2024-11-27 20:31:23,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-27 20:31:23,448 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.647058823529412) internal successors, (113), 18 states have internal predecessors, (113), 1 states have call successors, (1), 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 115 [2024-11-27 20:31:23,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:31:23,450 INFO L225 Difference]: With dead ends: 1846 [2024-11-27 20:31:23,450 INFO L226 Difference]: Without dead ends: 1846 [2024-11-27 20:31:23,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2024-11-27 20:31:23,451 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 970 mSDsluCounter, 7609 mSDsCounter, 0 mSdLazyCounter, 5424 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 8241 SdHoareTripleChecker+Invalid, 5447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 5424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:31:23,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 8241 Invalid, 5447 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 5424 Invalid, 0 Unknown, 0 Unchecked, 23.3s Time] [2024-11-27 20:31:23,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2024-11-27 20:31:23,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1817. [2024-11-27 20:31:23,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1517 states have (on average 1.6163480553724456) internal successors, (2452), 1805 states have internal predecessors, (2452), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-27 20:31:23,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2506 transitions. [2024-11-27 20:31:23,480 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2506 transitions. Word has length 115 [2024-11-27 20:31:23,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:31:23,481 INFO L471 AbstractCegarLoop]: Abstraction has 1817 states and 2506 transitions. [2024-11-27 20:31:23,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.647058823529412) internal successors, (113), 18 states have internal predecessors, (113), 1 states have call successors, (1), 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-27 20:31:23,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2506 transitions. [2024-11-27 20:31:23,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-27 20:31:23,481 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:31:23,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:31:23,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-27 20:31:23,482 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:31:23,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:31:23,482 INFO L85 PathProgramCache]: Analyzing trace with hash 68638717, now seen corresponding path program 1 times [2024-11-27 20:31:23,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:31:23,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627871190] [2024-11-27 20:31:23,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:31:23,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:31:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:31:26,914 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-27 20:31:26,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:31:26,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627871190] [2024-11-27 20:31:26,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627871190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:31:26,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:31:26,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-27 20:31:26,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983836992] [2024-11-27 20:31:26,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:31:26,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-27 20:31:26,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:31:26,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-27 20:31:26,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-27 20:31:26,916 INFO L87 Difference]: Start difference. First operand 1817 states and 2506 transitions. Second operand has 19 states, 18 states have (on average 6.333333333333333) internal successors, (114), 19 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:31:47,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:31:47,550 INFO L93 Difference]: Finished difference Result 1847 states and 2550 transitions. [2024-11-27 20:31:47,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-27 20:31:47,551 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.333333333333333) internal successors, (114), 19 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2024-11-27 20:31:47,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:31:47,553 INFO L225 Difference]: With dead ends: 1847 [2024-11-27 20:31:47,553 INFO L226 Difference]: Without dead ends: 1847 [2024-11-27 20:31:47,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2024-11-27 20:31:47,553 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 988 mSDsluCounter, 6770 mSDsCounter, 0 mSdLazyCounter, 4372 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 7405 SdHoareTripleChecker+Invalid, 4399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 4372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:31:47,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [997 Valid, 7405 Invalid, 4399 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 4372 Invalid, 0 Unknown, 0 Unchecked, 19.2s Time] [2024-11-27 20:31:47,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2024-11-27 20:31:47,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1819. [2024-11-27 20:31:47,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1819 states, 1519 states have (on average 1.6155365371955235) internal successors, (2454), 1807 states have internal predecessors, (2454), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 11 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-27 20:31:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 2512 transitions. [2024-11-27 20:31:47,574 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 2512 transitions. Word has length 116 [2024-11-27 20:31:47,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:31:47,575 INFO L471 AbstractCegarLoop]: Abstraction has 1819 states and 2512 transitions. [2024-11-27 20:31:47,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.333333333333333) internal successors, (114), 19 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:31:47,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 2512 transitions. [2024-11-27 20:31:47,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-27 20:31:47,575 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:31:47,576 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:31:47,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-27 20:31:47,576 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:31:47,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:31:47,576 INFO L85 PathProgramCache]: Analyzing trace with hash 68638718, now seen corresponding path program 1 times [2024-11-27 20:31:47,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:31:47,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112376907] [2024-11-27 20:31:47,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:31:47,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:31:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:31:51,539 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-27 20:31:51,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:31:51,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112376907] [2024-11-27 20:31:51,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112376907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:31:51,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:31:51,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-27 20:31:51,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472057798] [2024-11-27 20:31:51,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:31:51,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-27 20:31:51,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:31:51,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-27 20:31:51,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2024-11-27 20:31:51,541 INFO L87 Difference]: Start difference. First operand 1819 states and 2512 transitions. Second operand has 21 states, 20 states have (on average 5.7) internal successors, (114), 21 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:32:19,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:32:19,625 INFO L93 Difference]: Finished difference Result 1846 states and 2548 transitions. [2024-11-27 20:32:19,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-27 20:32:19,626 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.7) internal successors, (114), 21 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2024-11-27 20:32:19,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:32:19,628 INFO L225 Difference]: With dead ends: 1846 [2024-11-27 20:32:19,628 INFO L226 Difference]: Without dead ends: 1846 [2024-11-27 20:32:19,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=156, Invalid=1104, Unknown=0, NotChecked=0, Total=1260 [2024-11-27 20:32:19,630 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 949 mSDsluCounter, 7122 mSDsCounter, 0 mSdLazyCounter, 6019 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 7754 SdHoareTripleChecker+Invalid, 6043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:32:19,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 7754 Invalid, 6043 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 6019 Invalid, 0 Unknown, 0 Unchecked, 26.2s Time] [2024-11-27 20:32:19,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2024-11-27 20:32:19,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1819. [2024-11-27 20:32:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1819 states, 1517 states have (on average 1.6163480553724456) internal successors, (2452), 1807 states have internal predecessors, (2452), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 11 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-27 20:32:19,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 2510 transitions. [2024-11-27 20:32:19,647 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 2510 transitions. Word has length 116 [2024-11-27 20:32:19,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:32:19,648 INFO L471 AbstractCegarLoop]: Abstraction has 1819 states and 2510 transitions. [2024-11-27 20:32:19,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.7) internal successors, (114), 21 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:32:19,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 2510 transitions. [2024-11-27 20:32:19,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-27 20:32:19,649 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:32:19,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:32:19,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-27 20:32:19,649 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:32:19,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:32:19,650 INFO L85 PathProgramCache]: Analyzing trace with hash -721824312, now seen corresponding path program 1 times [2024-11-27 20:32:19,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:32:19,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046592423] [2024-11-27 20:32:19,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:32:19,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:32:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:32:19,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 20:32:19,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:32:19,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046592423] [2024-11-27 20:32:19,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046592423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:32:19,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:32:19,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:32:19,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523953606] [2024-11-27 20:32:20,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:32:20,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:32:20,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:32:20,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:32:20,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:32:20,001 INFO L87 Difference]: Start difference. First operand 1819 states and 2510 transitions. Second operand has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:32:24,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:32:24,091 INFO L93 Difference]: Finished difference Result 1818 states and 2508 transitions. [2024-11-27 20:32:24,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:32:24,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2024-11-27 20:32:24,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:32:24,095 INFO L225 Difference]: With dead ends: 1818 [2024-11-27 20:32:24,095 INFO L226 Difference]: Without dead ends: 1818 [2024-11-27 20:32:24,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:32:24,096 INFO L435 NwaCegarLoop]: 969 mSDtfsCounter, 4 mSDsluCounter, 2082 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3051 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:32:24,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3051 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-27 20:32:24,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2024-11-27 20:32:24,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1818. [2024-11-27 20:32:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1818 states, 1517 states have (on average 1.6150296638101516) internal successors, (2450), 1806 states have internal predecessors, (2450), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 11 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-27 20:32:24,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 2508 transitions. [2024-11-27 20:32:24,121 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 2508 transitions. Word has length 116 [2024-11-27 20:32:24,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:32:24,122 INFO L471 AbstractCegarLoop]: Abstraction has 1818 states and 2508 transitions. [2024-11-27 20:32:24,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:32:24,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2508 transitions. [2024-11-27 20:32:24,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-27 20:32:24,123 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:32:24,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:32:24,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-27 20:32:24,124 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:32:24,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:32:24,124 INFO L85 PathProgramCache]: Analyzing trace with hash -901716509, now seen corresponding path program 1 times [2024-11-27 20:32:24,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:32:24,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53027047] [2024-11-27 20:32:24,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:32:24,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:32:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:32:27,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:32:27,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:32:27,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53027047] [2024-11-27 20:32:27,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53027047] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:32:27,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693071634] [2024-11-27 20:32:27,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:32:27,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:32:27,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:32:27,212 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:32:27,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-27 20:32:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:32:27,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-27 20:32:27,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:32:27,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:32:28,316 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 20:32:28,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-27 20:32:28,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:32:28,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:32:29,367 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:32:29,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-27 20:32:29,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:32:29,681 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:32:29,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-27 20:32:29,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:32:29,999 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:32:29,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-27 20:32:30,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:32:30,338 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:32:30,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-27 20:32:30,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:32:30,672 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:32:30,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-27 20:32:30,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:32:31,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:32:31,359 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-27 20:32:31,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 97 treesize of output 63 [2024-11-27 20:32:31,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 51 treesize of output 32 [2024-11-27 20:32:31,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:32:32,077 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-27 20:32:32,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 58 [2024-11-27 20:32:32,093 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 51 treesize of output 32 [2024-11-27 20:32:32,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:32:33,050 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-27 20:32:33,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 16 [2024-11-27 20:32:33,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:32:33,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:32:33,557 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4299 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4298) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (< .cse0 0) (= (select |c_#valid| (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem62#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem62#1.base|) (+ 40 |c_ULTIMATE.start_main_#t~mem62#1.offset|) v_ArrVal_4299)))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) .cse0)) 1))))) is different from false [2024-11-27 20:32:38,095 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4296 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_12| Int) (v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4299 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |c_ULTIMATE.start_main_#t~malloc61#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4296)) (.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (select (select (store .cse0 .cse5 v_ArrVal_4298) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_12| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< .cse2 0) (= (select |c_#valid| (select (let ((.cse3 (store .cse4 .cse5 (store (select .cse4 .cse5) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_12| 40) v_ArrVal_4299)))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse2)) 1)))))) is different from false [2024-11-27 20:32:38,145 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 446 treesize of output 300 [2024-11-27 20:32:38,229 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4296 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem62#1.offset_12| Int) (v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4299 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_14| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_14|))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| v_ArrVal_4296)) (.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (select (select (store .cse0 .cse5 v_ArrVal_4298) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_12| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< .cse2 0) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_14| (select (let ((.cse3 (store .cse4 .cse5 (store (select .cse4 .cse5) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_12| 40) v_ArrVal_4299)))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse2))))))) is different from false [2024-11-27 20:32:38,327 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_12| Int) (v_ArrVal_4296 (Array Int Int)) (v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4299 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_14| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse6 (store (select |c_#memory_$Pointer$#1.base| .cse6) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_14|)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_4296)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (select (select (store .cse5 .cse3 v_ArrVal_4298) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_14| (select (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_12| 40) v_ArrVal_4299)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse4)) (< .cse4 0) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_12| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-27 20:32:38,656 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_12| Int) (v_ArrVal_4296 (Array Int Int)) (v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4299 Int) (v_ArrVal_4291 (Array Int Int)) (v_ArrVal_4292 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_14| Int)) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4292)) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4291))) (let ((.cse4 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_14|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4296)) (.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (select (select (store .cse0 .cse5 v_ArrVal_4298) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_12| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< .cse2 0) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_14| (select (let ((.cse3 (store .cse4 .cse5 (store (select .cse4 .cse5) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_12| 40) v_ArrVal_4299)))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse2))))))))) is different from false [2024-11-27 20:32:38,952 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_12| Int) (v_ArrVal_4296 (Array Int Int)) (v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4299 Int) (v_ArrVal_4291 (Array Int Int)) (v_ArrVal_4292 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_14| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4292))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4291))) (let ((.cse2 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_14|)))) (let ((.cse5 (store .cse6 .cse7 v_ArrVal_4296)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (select (select (store .cse5 .cse3 v_ArrVal_4298) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_14| (select (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_12| 40) v_ArrVal_4299)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse4)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_12| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< .cse4 0)))))))))) is different from false [2024-11-27 20:32:43,004 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_12| Int) (v_ArrVal_4296 (Array Int Int)) (v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4299 Int) (v_ArrVal_4290 (Array Int Int)) (v_ArrVal_4291 (Array Int Int)) (v_ArrVal_4292 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_14| Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4290)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store .cse10 .cse9 v_ArrVal_4292))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_4289) .cse9 v_ArrVal_4291))) (let ((.cse4 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |v_ULTIMATE.start_main_#t~malloc61#1.base_14|)))) (let ((.cse1 (store .cse6 .cse7 v_ArrVal_4296)) (.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (select (select (store .cse1 .cse5 v_ArrVal_4298) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (< .cse0 0) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_12| (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_14| (select (let ((.cse3 (store .cse4 .cse5 (store (select .cse4 .cse5) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_12| 40) v_ArrVal_4299)))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) .cse0))))))))))) is different from false [2024-11-27 20:32:43,096 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_12| Int) (v_ArrVal_4296 (Array Int Int)) (v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4299 Int) (v_ArrVal_4290 (Array Int Int)) (v_ArrVal_4291 (Array Int Int)) (v_ArrVal_4292 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_14| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4290))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4292))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4289) .cse10 v_ArrVal_4291))) (let ((.cse4 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_14|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4296)) (.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (select (select (store .cse0 .cse5 v_ArrVal_4298) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_12| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< .cse2 0) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_14| (select (let ((.cse3 (store .cse4 .cse5 (store (select .cse4 .cse5) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_12| 40) v_ArrVal_4299)))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse2))))))))))))) is different from false [2024-11-27 20:32:43,305 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_12| Int) (v_ArrVal_4296 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4299 Int) (v_ArrVal_4290 (Array Int Int)) (v_ArrVal_4291 (Array Int Int)) (v_ArrVal_4292 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_14| Int)) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4287)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_4290))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_4292))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_4288) .cse9 v_ArrVal_4289) .cse10 v_ArrVal_4291))) (let ((.cse3 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |v_ULTIMATE.start_main_#t~malloc61#1.base_14|)))) (let ((.cse5 (store .cse6 .cse7 v_ArrVal_4296)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (select (select (store .cse5 .cse4 v_ArrVal_4298) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (< .cse0 0) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_14| (select (let ((.cse1 (store .cse3 .cse4 (store (select .cse3 .cse4) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_12| 40) v_ArrVal_4299)))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) .cse0)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_12| (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))))))) is different from false [2024-11-27 20:32:43,410 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_12| Int) (v_ArrVal_4296 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4299 Int) (v_ArrVal_4290 (Array Int Int)) (v_ArrVal_4291 (Array Int Int)) (v_ArrVal_4292 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_14| Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4287))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4290))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4292))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4288) .cse10 v_ArrVal_4289) .cse11 v_ArrVal_4291))) (let ((.cse4 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |v_ULTIMATE.start_main_#t~malloc61#1.base_14|)))) (let ((.cse1 (store .cse6 .cse7 v_ArrVal_4296)) (.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (select (select (store .cse1 .cse5 v_ArrVal_4298) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (< .cse0 0) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_12| (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_14| (select (let ((.cse3 (store .cse4 .cse5 (store (select .cse4 .cse5) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_12| 40) v_ArrVal_4299)))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) .cse0))))))))))))))) is different from false [2024-11-27 20:32:43,610 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_12| Int) (v_ArrVal_4299 Int) (v_ArrVal_4290 (Array Int Int)) (v_ArrVal_4291 (Array Int Int)) (v_ArrVal_4292 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_14| Int) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4296 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4285)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_4287))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_4290))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_4292))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_4286) .cse9 v_ArrVal_4288) .cse10 v_ArrVal_4289) .cse11 v_ArrVal_4291))) (let ((.cse4 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |v_ULTIMATE.start_main_#t~malloc61#1.base_14|)))) (let ((.cse1 (store .cse6 .cse7 v_ArrVal_4296)) (.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (select (select (store .cse1 .cse5 v_ArrVal_4298) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (< .cse0 0) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_12| (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_14| (select (let ((.cse3 (store .cse4 .cse5 (store (select .cse4 .cse5) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_12| 40) v_ArrVal_4299)))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) .cse0))))))))))))))) is different from false [2024-11-27 20:32:43,724 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_12| Int) (v_ArrVal_4299 Int) (v_ArrVal_4290 (Array Int Int)) (v_ArrVal_4291 (Array Int Int)) (v_ArrVal_4292 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_14| Int) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4296 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_4285))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4287))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4290))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4292))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse6 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_4286) .cse10 v_ArrVal_4288) .cse11 v_ArrVal_4289) .cse12 v_ArrVal_4291))) (let ((.cse4 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) |v_ULTIMATE.start_main_#t~malloc61#1.base_14|)))) (let ((.cse0 (store .cse6 .cse7 v_ArrVal_4296)) (.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (select (select (store .cse0 .cse5 v_ArrVal_4298) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_12| (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< .cse2 0) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_14| (select (let ((.cse3 (store .cse4 .cse5 (store (select .cse4 .cse5) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_12| 40) v_ArrVal_4299)))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) .cse2))))))))))))))))) is different from false [2024-11-27 20:32:44,098 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_12| Int) (v_ArrVal_4299 Int) (v_ArrVal_4290 (Array Int Int)) (v_ArrVal_4291 (Array Int Int)) (v_ArrVal_4292 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_14| Int) (v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4296 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4287 (Array Int Int)) (v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4288 (Array Int Int)) (v_ArrVal_4289 (Array Int Int)) (v_ArrVal_4304 (Array Int Int)) (v_ArrVal_4305 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4304)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_4285))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_4287))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_4290))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store .cse13 .cse12 v_ArrVal_4292))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (.cse6 (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_4305) .cse9 v_ArrVal_4286) .cse10 v_ArrVal_4288) .cse11 v_ArrVal_4289) .cse12 v_ArrVal_4291))) (let ((.cse4 (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |v_ULTIMATE.start_main_#t~malloc61#1.base_14|)))) (let ((.cse1 (store .cse6 .cse7 v_ArrVal_4296)) (.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (select (select (store .cse1 .cse5 v_ArrVal_4298) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (< .cse0 0) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_12| (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_14| (select (let ((.cse3 (store .cse4 .cse5 (store (select .cse4 .cse5) (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_12| 40) v_ArrVal_4299)))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) .cse0))))))))))))))))) is different from false [2024-11-27 20:32:44,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693071634] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:32:44,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:32:44,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2024-11-27 20:32:44,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697801154] [2024-11-27 20:32:44,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:32:44,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-27 20:32:44,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:32:44,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-27 20:32:44,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1403, Unknown=21, NotChecked=1144, Total=2756 [2024-11-27 20:32:44,108 INFO L87 Difference]: Start difference. First operand 1818 states and 2508 transitions. Second operand has 37 states, 34 states have (on average 5.676470588235294) internal successors, (193), 37 states have internal predecessors, (193), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:33:19,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:33:19,262 INFO L93 Difference]: Finished difference Result 1842 states and 2542 transitions. [2024-11-27 20:33:19,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-27 20:33:19,263 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 5.676470588235294) internal successors, (193), 37 states have internal predecessors, (193), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 117 [2024-11-27 20:33:19,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:33:19,265 INFO L225 Difference]: With dead ends: 1842 [2024-11-27 20:33:19,265 INFO L226 Difference]: Without dead ends: 1842 [2024-11-27 20:33:19,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=337, Invalid=2664, Unknown=21, NotChecked=1534, Total=4556 [2024-11-27 20:33:19,267 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 910 mSDsluCounter, 12299 mSDsCounter, 0 mSdLazyCounter, 7547 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 12933 SdHoareTripleChecker+Invalid, 7592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 7547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:33:19,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 12933 Invalid, 7592 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [45 Valid, 7547 Invalid, 0 Unknown, 0 Unchecked, 33.0s Time] [2024-11-27 20:33:19,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2024-11-27 20:33:19,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1817. [2024-11-27 20:33:19,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1517 states have (on average 1.6137112722478577) internal successors, (2448), 1805 states have internal predecessors, (2448), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 11 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-27 20:33:19,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2506 transitions. [2024-11-27 20:33:19,282 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2506 transitions. Word has length 117 [2024-11-27 20:33:19,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:33:19,282 INFO L471 AbstractCegarLoop]: Abstraction has 1817 states and 2506 transitions. [2024-11-27 20:33:19,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 5.676470588235294) internal successors, (193), 37 states have internal predecessors, (193), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:33:19,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2506 transitions. [2024-11-27 20:33:19,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-27 20:33:19,283 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:33:19,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:33:19,292 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-27 20:33:19,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2024-11-27 20:33:19,483 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-27 20:33:19,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:33:19,484 INFO L85 PathProgramCache]: Analyzing trace with hash -901716508, now seen corresponding path program 1 times [2024-11-27 20:33:19,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:33:19,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253478586] [2024-11-27 20:33:19,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:33:19,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:33:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:22,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:33:22,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:33:22,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253478586] [2024-11-27 20:33:22,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253478586] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:33:22,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767997547] [2024-11-27 20:33:22,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:33:22,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:33:22,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:33:22,555 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:33:22,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb5a8311-ffde-414b-9dcd-caa4d6b724fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-27 20:33:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:33:22,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-27 20:33:22,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:33:23,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:33:23,675 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 20:33:23,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-27 20:33:23,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:33:23,913 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:33:23,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-27 20:33:24,162 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:33:24,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-27 20:33:24,424 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:33:24,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-27 20:33:24,710 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:33:24,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-27 20:33:24,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-27 20:33:24,981 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:33:24,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-27 20:33:24,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-11-27 20:33:25,052 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-27 20:33:25,172 INFO L349 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2024-11-27 20:33:25,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 72 [2024-11-27 20:33:25,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2024-11-27 20:33:25,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:33:25,618 INFO L349 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2024-11-27 20:33:25,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 82 [2024-11-27 20:33:25,678 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-27 20:33:25,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 47 [2024-11-27 20:33:26,412 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-27 20:33:26,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 29 [2024-11-27 20:33:26,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:33:26,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:33:27,201 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem62#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem62#1.base|)) (.cse6 (+ 40 |c_ULTIMATE.start_main_#t~mem62#1.offset|))) (and (forall ((v_ArrVal_4531 (Array Int Int))) (or (forall ((v_ArrVal_4529 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4531)) (.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem62#1.base| (store .cse5 .cse6 v_ArrVal_4529)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select .cse0 .cse1) .cse2) 384) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (= v_ArrVal_4531 (store .cse7 .cse6 (select v_ArrVal_4531 .cse6)))))) (forall ((v_ArrVal_4531 (Array Int Int))) (or (forall ((v_ArrVal_4529 Int)) (<= 0 (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem62#1.base| v_ArrVal_4531))) (select (select .cse8 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem62#1.base| (store .cse5 .cse6 v_ArrVal_4529)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))) (not (= v_ArrVal_4531 (store .cse7 .cse6 (select v_ArrVal_4531 .cse6)))))))) is different from false [2024-11-27 20:33:27,331 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse4)) (.cse1 (select |c_#memory_$Pointer$#1.offset| .cse4)) (.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (and (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_15| .cse0) (forall ((v_ArrVal_4531 (Array Int Int))) (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_15| 40))) (or (not (= (store .cse1 .cse2 (select v_ArrVal_4531 .cse2)) v_ArrVal_4531)) (forall ((v_ArrVal_4529 Int)) (<= 0 (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_4531))) (select (select .cse3 (select (select (store |c_#memory_$Pointer$#1.base| .cse4 (store .cse5 .cse2 v_ArrVal_4529)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_15| Int)) (or (forall ((v_ArrVal_4531 (Array Int Int))) (let ((.cse11 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_15| 40))) (or (forall ((v_ArrVal_4529 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_4531)) (.cse10 (store |c_#memory_$Pointer$#1.base| .cse4 (store .cse5 .cse11 v_ArrVal_4529)))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (.cse9 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (<= (+ (select (select .cse7 .cse8) .cse9) 384) (select |c_#length| (select (select .cse10 .cse8) .cse9)))))) (not (= (store .cse1 .cse11 (select v_ArrVal_4531 .cse11)) v_ArrVal_4531))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_15| .cse0))))))) is different from false [2024-11-27 20:33:27,609 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |c_ULTIMATE.start_main_#t~malloc61#1.base|))) (.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse9 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| |c_ULTIMATE.start_main_#t~malloc61#1.offset|)))) (let ((.cse11 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse7 (select .cse5 .cse6)) (.cse10 (select .cse9 .cse6))) (and (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_15| Int)) (or (forall ((v_ArrVal_4531 (Array Int Int))) (let ((.cse8 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_15| 40))) (or (forall ((v_ArrVal_4529 Int)) (let ((.cse0 (store .cse9 .cse6 v_ArrVal_4531)) (.cse3 (store .cse5 .cse6 (store .cse7 .cse8 v_ArrVal_4529)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select .cse0 .cse1) .cse2) 384) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (= (store .cse10 .cse8 (select v_ArrVal_4531 .cse8)) v_ArrVal_4531))))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_15| .cse11))) (forall ((|v_ULTIMATE.start_main_#t~mem62#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_15| .cse11) (forall ((v_ArrVal_4531 (Array Int Int))) (let ((.cse13 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_15| 40))) (or (forall ((v_ArrVal_4529 Int)) (<= 0 (let ((.cse12 (store .cse9 .cse6 v_ArrVal_4531))) (select (select .cse12 (select (select (store .cse5 .cse6 (store .cse7 .cse13 v_ArrVal_4529)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))) (not (= (store .cse10 .cse13 (select v_ArrVal_4531 .cse13)) v_ArrVal_4531))))))))))) is different from false [2024-11-27 20:33:27,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 942 treesize of output 791 [2024-11-27 20:33:28,264 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem60#1.base|) |c_ULTIMATE.start_main_#t~mem60#1.offset| 0))) (.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base|))) (and (forall ((v_prenex_52 (Array Int Int)) (v_prenex_51 Int) (v_prenex_53 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_17|)))) (let ((.cse2 (+ 40 v_prenex_53)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (or (not (= (store (select .cse0 .cse1) .cse2 (select v_prenex_52 .cse2)) v_prenex_52)) (< (let ((.cse3 (store .cse0 .cse1 v_prenex_52))) (select (select .cse3 (select (select (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 v_prenex_51)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) 1) (< v_prenex_53 .cse6))))) (forall ((v_ArrVal_4529 Int) (v_ArrVal_4531 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_15| Int)) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_17|)))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse11 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_15| 40))) (or (< 0 (+ (let ((.cse8 (store .cse0 .cse10 v_ArrVal_4531))) (select (select .cse8 (select (select (store .cse9 .cse10 (store (select .cse9 .cse10) .cse11 v_ArrVal_4529)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) 1)) (not (= v_ArrVal_4531 (store (select .cse0 .cse10) .cse11 (select v_ArrVal_4531 .cse11)))) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_15| .cse6))))) (forall ((v_prenex_52 (Array Int Int)) (v_prenex_51 Int) (v_prenex_53 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem60#1.base| (store .cse7 |c_ULTIMATE.start_main_#t~mem60#1.offset| |v_ULTIMATE.start_main_#t~malloc61#1.base_17|)))) (let ((.cse13 (+ 40 v_prenex_53)) (.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (or (not (= (store (select .cse0 .cse12) .cse13 (select v_prenex_52 .cse13)) v_prenex_52)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_17| (select (let ((.cse14 (store .cse15 .cse12 (store (select .cse15 .cse12) .cse13 v_prenex_51)))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (select (select (store .cse0 .cse12 v_prenex_52) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< v_prenex_53 .cse6)))))))) is different from false [2024-11-27 20:33:30,526 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_52 (Array Int Int)) (v_ArrVal_4522 (Array Int Int)) (v_ArrVal_4523 (Array Int Int)) (v_prenex_51 Int) (v_prenex_53 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4522)) (.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4523))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse3 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc61#1.base_17|)))) (let ((.cse0 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse5 (+ 40 v_prenex_53))) (or (< v_prenex_53 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc61#1.base_17| (select (let ((.cse2 (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_prenex_51)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse0 .cse4 v_prenex_52) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= v_prenex_52 (store (select .cse0 .cse4) .cse5 (select v_prenex_52 .cse5)))))))))) (forall ((v_prenex_52 (Array Int Int)) (v_ArrVal_4522 (Array Int Int)) (v_ArrVal_4523 (Array Int Int)) (v_prenex_51 Int) (v_prenex_53 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int)) (let ((.cse15 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4522)) (.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4523))) (let ((.cse16 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse17 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse11 (store .cse18 .cse16 (store (select .cse18 .cse16) .cse17 |v_ULTIMATE.start_main_#t~malloc61#1.base_17|)))) (let ((.cse14 (store .cse15 .cse16 (store (select .cse15 .cse16) .cse17 0))) (.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse13 (+ 40 v_prenex_53))) (or (< (let ((.cse10 (store .cse14 .cse12 v_prenex_52))) (select (select .cse10 (select (select (store .cse11 .cse12 (store (select .cse11 .cse12) .cse13 v_prenex_51)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (< v_prenex_53 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (not (= v_prenex_52 (store (select .cse14 .cse12) .cse13 (select v_prenex_52 .cse13)))))))))) (forall ((v_ArrVal_4529 Int) (v_ArrVal_4531 (Array Int Int)) (v_ArrVal_4522 (Array Int Int)) (v_ArrVal_4523 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_15| Int)) (let ((.cse24 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4522)) (.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem59#1.base| v_ArrVal_4523))) (let ((.cse25 (select (select .cse27 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse26 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse21 (store .cse27 .cse25 (store (select .cse27 .cse25) .cse26 |v_ULTIMATE.start_main_#t~malloc61#1.base_17|)))) (let ((.cse19 (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 0))) (.cse22 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse23 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_15| 40))) (or (< |v_ULTIMATE.start_main_#t~mem62#1.offset_15| (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (< 0 (+ (let ((.cse20 (store .cse19 .cse22 v_ArrVal_4531))) (select (select .cse20 (select (select (store .cse21 .cse22 (store (select .cse21 .cse22) .cse23 v_ArrVal_4529)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (not (= (store (select .cse19 .cse22) .cse23 (select v_ArrVal_4531 .cse23)) v_ArrVal_4531)))))))))) is different from false [2024-11-27 20:33:31,485 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_prenex_52 (Array Int Int)) (v_ArrVal_4522 (Array Int Int)) (v_ArrVal_4523 (Array Int Int)) (v_prenex_51 Int) (v_prenex_53 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_4522)) (.cse9 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_4523))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse2 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |v_ULTIMATE.start_main_#t~malloc61#1.base_17|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse4 (+ 40 v_prenex_53)) (.cse5 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0)))) (or (= |v_ULTIMATE.start_main_#t~malloc61#1.base_17| (select (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_prenex_51)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (select (select (store .cse5 .cse3 v_prenex_52) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (not (= (store (select (store .cse6 .cse7 (store v_ArrVal_4522 .cse8 0)) .cse3) .cse4 (select v_prenex_52 .cse4)) v_prenex_52)) (< v_prenex_53 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) (forall ((v_ArrVal_4529 Int) (v_ArrVal_4531 (Array Int Int)) (v_ArrVal_4522 (Array Int Int)) (v_ArrVal_4523 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int) (|v_ULTIMATE.start_main_#t~mem62#1.offset_15| Int)) (let ((.cse16 (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_4522)) (.cse19 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_4523))) (let ((.cse17 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse18 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse15 (store .cse19 .cse17 (store (select .cse19 .cse17) .cse18 |v_ULTIMATE.start_main_#t~malloc61#1.base_17|)))) (let ((.cse13 (+ |v_ULTIMATE.start_main_#t~mem62#1.offset_15| 40)) (.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse11 (store .cse16 .cse17 (store (select .cse16 .cse17) .cse18 0)))) (or (not (= v_ArrVal_4531 (store (select .cse11 .cse12) .cse13 (select v_ArrVal_4531 .cse13)))) (< 0 (+ (let ((.cse14 (store .cse11 .cse12 v_ArrVal_4531))) (select (select .cse14 (select (select (store .cse15 .cse12 (store (select .cse15 .cse12) .cse13 v_ArrVal_4529)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) (< |v_ULTIMATE.start_main_#t~mem62#1.offset_15| (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) (forall ((v_prenex_52 (Array Int Int)) (v_ArrVal_4522 (Array Int Int)) (v_ArrVal_4523 (Array Int Int)) (v_prenex_51 Int) (v_prenex_53 Int) (|v_ULTIMATE.start_main_#t~malloc61#1.base_17| Int)) (let ((.cse25 (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_4522)) (.cse28 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_4523))) (let ((.cse26 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse27 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse21 (store .cse28 .cse26 (store (select .cse28 .cse26) .cse27 |v_ULTIMATE.start_main_#t~malloc61#1.base_17|)))) (let ((.cse22 (select (select .cse21 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (.cse23 (+ 40 v_prenex_53)) (.cse24 (store .cse25 .cse26 (store (select .cse25 .cse26) .cse27 0)))) (or (< (let ((.cse20 (store .cse24 .cse22 v_prenex_52))) (select (select .cse20 (select (select (store .cse21 .cse22 (store (select .cse21 .cse22) .cse23 v_prenex_51)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1) (not (= v_prenex_52 (store (select .cse24 .cse22) .cse23 (select v_prenex_52 .cse23)))) (< v_prenex_53 (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) is different from false [2024-11-27 20:33:33,228 INFO L349 Elim1Store]: treesize reduction 271, result has 69.4 percent of original size [2024-11-27 20:33:33,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 4419927 treesize of output 4384186 [2024-11-27 20:33:35,023 INFO L349 Elim1Store]: treesize reduction 275, result has 30.2 percent of original size [2024-11-27 20:33:35,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 68495 treesize of output 66880 [2024-11-27 20:33:35,580 INFO L349 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2024-11-27 20:33:35,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69688 treesize of output 68795 [2024-11-27 20:33:41,085 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 13 treesize of output 1 [2024-11-27 20:33:42,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:33:42,522 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 28 treesize of output 30 [2024-11-27 20:33:42,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:33:42,824 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 28 treesize of output 30 [2024-11-27 20:33:56,975 INFO L224 Elim1Store]: Index analysis took 154 ms [2024-11-27 20:33:58,393 INFO L349 Elim1Store]: treesize reduction 139, result has 37.4 percent of original size [2024-11-27 20:33:58,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 13721 treesize of output 13534 [2024-11-27 20:34:06,044 INFO L349 Elim1Store]: treesize reduction 21, result has 32.3 percent of original size [2024-11-27 20:34:06,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 38 [2024-11-27 20:34:06,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:34:06,213 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 60545 treesize of output 60421